Time
Table of Algorithms and Their Time Complexities
Algorithm/Data Structure | Best Case | Average Case | Worst Case |
Sorting Algorithms | |||
Bubble Sort | O(n) | O(n²) | O(n²) |
Selection Sort | O(n²) | O(n²) | O(n²) |
Insertion Sort | O(n) | O(n²) | O(n²) |
Merge Sort | O(n log n) | O(n log n) | O(n log n) |
Quick Sort | O(n log n) | O(n log n) | O(n²) |
Searching Algorithms | |||
Linear Search | O(1) | O(n) | O(n) |
Binary Search | O(1) | O(log n) | O(log n) |
Data Structures - Linked List | |||
Access | O(1) | O(n) | O(n) |
Search | O(1) | O(n) | O(n) |
Insert | O(1) | O(n) | O(n) |
Delete | O(1) | O(n) | O(n) |
Data Structures - Binary Tree | |||
Access | O(log n) | O(log n) | O(n) |
Search | O(log n) | O(log n) | O(n) |
Insert | O(log n) | O(log n) | O(n) |
Delete | O(log n) | O(log n) | O(n) |
Data Structures - Hash Table | |||
Search | O(1) | O(1) | O(n) |
Insert | O(1) | O(1) | O(n) |
Delete | O(1) | O(1) | O(n) |