Please enable JavaScript.
Coggle requires JavaScript to display documents.
Searching Algorithm - Coggle Diagram
Searching Algorithm
Linear Search
Searches elements one by one
Works on unsorted data
Number of Operations
Best Case = 1 comparison
Average Case = n/2 comparisons
Worst Case = n comparisons
Time Complexity = O(n)
Performance
Simple to implement
Slow for large datasets
Efficiency = Low
Binary Search
Searches by dividing dataset into halves
Requires sorted data
Number of Operations
Best Case = 1 comparison
Average Case = log₂n comparisons
Worst Case = log₂n comparisons
Time Complexity = O(log n)
Performance
Very fast for large datasets
Requires sorted data
Efficiency = High
Conclusion
Binary Search is more efficient
Performs only log₂n operations
Suitable for large sorted datasets
Linear Search is preferred only when data is unsorted or very small
Time Complexity
Linear Search → O(n)
Binary Search → O(log n)
Fewer operations → Faster execution
Efficiency Comparison
Linear Search
More comparisons
Less efficient for large datasets
Binary Search
Fewer comparisons
More efficient for large datasets
Binary Search > Linear Search (for sorted data)