Wipro Company Category

A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is
(a) Quick Sort
(b) Heap Sort
(c) Merge Sort
(d) Insert Sort

Read Solution (Total 4)

quick sort
7 years agoHelpfull: Yes(6) No(0)

Quick Sort
5 years agoHelpfull: Yes(0) No(0)
quick sort
5 years agoHelpfull: Yes(0) No(0)
Quick sort
4 years agoHelpfull: Yes(0) No(0)

Wipro Other Question

The format specifier "-%d" is used for which purpose in C
(a) Left justifying a string
(b) Right justifying a string
(c) Removing a string from the console
(d) Used for the scope specification of a char[] variable What details should never be found in the top level of a top-down design?
(a) Details
(b) Coding
(c) Decisions
(d) None of the above