lower-bound

Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an a...

Consider a complete binary tree where the left and the right sub-trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of

Minimum number of comparisons required to sort 5 elements