quick notes for Sort Algorithm 

## Bubble Sort 

Best case => O(n)

Worst case => O(n^2)

![][bubble_sort_image]



## Insertion Sort

Best case => O(n)
Worst case => O(n^2) but less than bubble sort

![][insertion_sort_image]

[bubble_sort_image]: https://upload.wikimedia.org/wikipedia/commons/c/c8/Bubble-sort-example-300px.gif
[insertion_sort_image]: https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif

quick notes for Sort Algorithm 

## Bubble Sort 

Best case => O(n)

Worst case => O(n^2)

![][bubble_sort_image]



## Insertion Sort

Best case => O(n)
Worst case => O(n^2) but less than bubble sort

![][insertion_sort_image]

## Merge Sort

Best case = Worst case = O (n log n)

![][merge_sort_image]

## Quick Sort

Best case => O(n log n) most of case less than Merge Sort
Worst case => O(n^2)

![][quick_sort_image]

[bubble_sort_image]: https://upload.wikimedia.org/wikipedia/commons/c/c8/Bubble-sort-example-300px.gif
[insertion_sort_image]: https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif
[merge_sort_image]: https://en.wikipedia.org/wiki/Merge_sort#/media/File:Merge-sort-example-300px.gif
[quick_sort_image]: https://en.wikipedia.org/wiki/File:Sorting_quicksort_anim.gif

Reference:
https://en.wikipedia.org/wiki/

Add Merge sort and Quick sort
Add Merge sort and Quick sort