Campus Recruitment Tech Quiz-19

The sorting algorithm which requires least number of swaps in the worst case is

Consider the process of inserting an element into a max-Heap, represented in an array of size n. If a binary search is performed on the path from newly inserted element to the root then the number of element comparisons made is

Consider the following C program:

Which of the following represents output of above C program?

Consider the following program:

What is the output of above program ?