Patika.dev data structures and algorithm education
Task-1 [22,27,16,2,18,6] [2,27,16,22,18,6] [2,6,16,22,18,27] [2,6,16,18,22,27]
for 18 Time Complexity = Average Case
Big O Notation = O(n^2)
[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) [2,3,4,5,6,9,8,15,7]
Task-2
[16,21,11,8,12,22]
(16,21,11) - (8,12,22) (16,21) - (11) - (8,12) - (22) (11,16,21) - (8,12,22) (8,11,16,21,22)
Big O Notation = O(nlogn)
Task-3
(7,5,1,8,3,6,0,9,4,2)
6
5 7
0 8
2 9
1 4
3