Campus Recruitment Tech Quiz-3

Consider the Quicksort algorithm in which, while partitioning the array, we always choose the first element as pivot. By choosing pivot as the first element, the worst case of quicksort can occur, which has a time complexity of O(n²). But if we choose pivot wisely, this worst case can be avoided. So we developed an algorithm that selects the median of an array in O(n²) time and then use that median to partition the array. Find the best case time complexity of this algorithm?

In the Worst case, in Selection Sort, the total number of moves represented in order of______?

What is the output of above program ?

void main( )

{   static int i = 6;

     if (– – i)

       {

          main( );

          printf(“%d”, i);

       }

}

Which is the output of above program?

Consider the following code

#include

int main()

{

char x[6] = “world”;

int k,I;

for( k=0,I=4; k<I){

x[k++]=x[I--];
}

printf(“%s\n”,x);

}

Output of the above code is