Skip to content

Latest commit

 

History

History
15 lines (11 loc) · 406 Bytes

File metadata and controls

15 lines (11 loc) · 406 Bytes

Searching-Algorithms

This Repository contains Searching Algorithms in an Array.

Input Format : an int num for value you want to search in the array Output Format : num found at index i Space Complexity : O(1)

Time Complexity :

Linear Search : O(N) Binary Search : O(log N) Jump Search : O(√N) Interpolation Search : O(log log N) if elements are uniformly distributed Exponential Search : O(log N)