Proje 1 [22,27,16,2,18,6] -> Insertion Sort
[22,27,16,2,18,6]=n
[2,27,16,22,18,6]=n-1
[2,6,16,22,18,27]=n-2
[2,6,16,18,22,27]=1
Big-O gösterimi:n^2
Time Complexity(18):Worst case
[7,3,5,8,2,9,4,15,6] dizisinin Selection Sort'a göre ilk 4 adımını yazınız.
[7,3,5,8,2,9,4,15,6]
[2,3,5,8,7,9,4,15,6]
[2,3,4,8,7,9,5,15,6]
[2,3,4,5,7,9,8,15,6]