markamok

Sorting algorithms and their big O’s

Worst Case Best Case Average Case Bubble Sort O(n2) O(n) O(n2) Insertion Sort O(n2) O(n) O(n2) Selection Sort O(n²) O(n²) O(n²) Merge Sort O(nlogn) O(nlogn) O(nlogn) Quicksort O(n2) O(nlogn) O(nlogn)

“The Greatest Story Ever Told”

A Sonnet It happened long ago and far away, A princess died and born to her, a son He’d later use the force and save the day But first Luke learned to use a blaster gun.