Campus Recruitment Tech Quiz- 21

What is the worst case complexity of bubble sort?

void main ( )

{

char P[7] = “123456”, *q;

q = P + 3;

*q = ‘0’;

printf(“%s", P);

}

What is the output of above program?

for(i=2; i<10; i+=2)
              if(i==6)
                     continue;
              else
                      printf(“%d” ,i );
The above code results in

Which of the following is/are stable algorithms?

1) Bubble sort

2) merge sort

3) Heap sort

4) insertion sort