Searching Algorithms
Learn about different searching techniques and their implementations
Linear Search
Time Complexity: O(n) | Space Complexity: O(1)
A simple search algorithm that checks each element in a list sequentially until the desired element is found or the list ends.
Binary Search
Time Complexity: O(log n) | Space Complexity: O(1)
An efficient search algorithm that works on sorted arrays by repeatedly dividing the search interval in half.
Jump Search
Time Complexity: O(√n) | Space Complexity: O(1)
A search algorithm that works on sorted arrays by jumping ahead by fixed steps and then performing linear search.