Who was the peron who sat o n the fence?
humpdy dumpdy, and he broke it!! :)
humpdy dumpdy sat on a wall, humpdy dumpdy had a great fall, all the kings horses and all the kings men, put humpdy dumpdy together again.....
kinda a dumb song bt he fell and broke into pieces and everybody put him back together. (its a fairytale type thing)
There are many sorting algorithms with worst case of complexity O(n2). These algorithms have different average and best cases. They are: Best case Average case Worst case 1) Quick sort O(n*log n) O(n*log n) O(n2) 2) Insertion sort O(n) O(n2) O(n2) 3) Bubble sort O(n) O(n2) O(n2) 4) Selection sort O(n2) O(n2) O(n2)