• Linear Search
    • Sequential search value in array | O(n)
  • Binary Search
    • Sequential Searching sorted array
    • Find middle element if required element is more than middle then go to right arr and so on.
    • O(nlogn)
  • Jump Search
    • Jump fixed no of steps
    • If required no is less than new step ele do linear search from previous step
    • Time Complexity O(√n)
    • BS is better but we have to traverse once only
    • Step size is √n
  • Interpolation Search
    • Improvement over binary search
    • If element is closer to lower start from lower end and if closer to higher start from hi index | TC : O(loglogn)
  • Exponential Search
    • Find range in which element lie then do binary search over that O(logn)
    • Start with arr of 1 => 2=>4 till last ele is not greater than current.

3 thoughts on “Searching

Add yours

  1. track of a writer’s work.6. pagebreeze -…a free visual (wysiwyg) and html tag/source modes that creates websites instantly. this is a must for promoting a writer’s work on the internet.7. photo razor – a simple tool that re-sizes photos without cropping them.8. edit pad lite – advanced…


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Create a website or blog at

Up ↑

%d bloggers like this: