Big O Notation

Worst case time complexity for Bubble Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Best case time complexity for Insertion Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Average case time complexity for Merge Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Worst case time complexity for Quick Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Best case time complexity for Bubble Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Average case time complexity for Insertion Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Worst case time complexity for Quick Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Best case time complexity for Bubble Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Average case time complexity for Insertion Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic

Worst case time complexity for Merge Sort

• O(n^2) - Polynomial

• O(1) - Constant

• O(n) - Linear

• O(n log n) - Linearithmic