What is the worst-case time complexity of brick sort?

Sorting Algorithms Questions



80 Short 66 Medium 49 Long Answer Questions Question Index

What is the worst-case time complexity of brick sort?

The worst-case time complexity of brick sort is O(n^2), where n is the number of elements to be sorted.