kompleksitas algoritma sortir shell
O(n* logn) is the best case
O(n* log2n) is the worst case
Old-fashioned Okapi
O(n* logn) is the best case
O(n* log2n) is the worst case