Sorting Algorithms Questions
The worst-case time complexity of gnome sort is O(n^2), where n represents the number of elements in the array being sorted.