0 votes
43
2 votes
46
1 votes
47
0 votes
49
3 votes
50
3 votes
51
The running time of Quick sort algorithm depends heavily on the selection of:No. of inputsArrangement of elements in an arraySize of elementsPivot Element
0 votes
53
2 votes
60
0 votes
62
A $WFF$ that is equivalent to the $WFF$ $x= y$ is :$y=>x$~$y=>x$~$y=>$ ~$x$$y=>$ ~$x$
2 votes
67
5 votes
70
Output of following program#include<stdio.h int main() { int i=5; printf("%d %d %d", i++,i++,i++); return 0; }$7\:6\:5$$5\:6\:7$$7\:7\:7$Compiler Dependent