Please enable JavaScript.
Coggle requires JavaScript to display documents.
Searching - Coggle Diagram
Searching
Linear Search
Checks each element one by one
Works on Unsorted Data
Time Complexity
Best Case → O(1)
Average Case → O(n)
Worst Case → O(n)
Performance
Slow for large datasets
Simple to implement
Binary Search
Requires Sorted Data
Data must be arranged in ascending or descending order
Divide and Conquer
Compare with middle element
Search left half or right half
Time Complexity
Best Case → O(1)
Average Case → O(log n)
Worst Case → O(log n)
Performance
Very fast for large datasets
Efficient for digital archives
Performance
Depends on Data Organization
Unsorted Data → Linear Search
Sorted Data → Binary Search
Faster retrieval
Better scalability
Sorted Data
Enables Binary Search
Improves Search Efficiency
Time Complexity
Measures number of operations
Lower complexity means faster search