Scribd
Upload
83 views3 pages

Asymptotic Analysis Big-Oh: Basic Examples: Design and Analysis of Algorithms I

The document provides examples of Big-Oh asymptotic analysis. It gives two examples analyzing algorithms, showing that a linear search has complexity O(n) as it may need to examine each of n elements to find a match, and that a binary search has complexity O(log n) as it can halve the number of elements considered each step.

Uploaded by

Abhinav Gupta
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
83 views3 pages

Asymptotic Analysis Big-Oh: Basic Examples: Design and Analysis of Algorithms I

The document provides examples of Big-Oh asymptotic analysis. It gives two examples analyzing algorithms, showing that a linear search has complexity O(n) as it may need to examine each of n elements to find a match, and that a binary search has complexity O(log n) as it can halve the number of elements considered each step.

Uploaded by

Abhinav Gupta
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Asymptotic Analysis Big-Oh: Basic Examples

Design and Analysis of Algorithms I

Example #1

Tim Roughgarden

Example #2

Tim Roughgarden

You might also like