Sorting Algorithms Questions
The best-case time complexity of insertion sort is O(n), where n is the number of elements in the array.