What is the time complexity of insertion sort in Java?

What is the time complexity of insertion sort in Java?

The time complexity of insertion sort in Java is O(n^2) in the worst and average cases, and O(n) in the best case.

Can you explain why the worst-case time complexity is O(n^2)?

Certainly! In the worst case, the algorithm has to compare each element with all the previously sorted elements, leading to n*(n-1)/2 comparisons.

How does insertion sort compare to other sorting algorithms like quicksort?

Insertion sort is generally slower than quicksort, which has an average time complexity of O(n log n), but it can be more efficient for small datasets.

Are there any scenarios where insertion sort is preferred?

Yes, insertion sort is preferred for small datasets or nearly sorted arrays, as it can perform better than more complex algorithms in those cases.