______ Sorting algorithm does not have a worst case running time O (n²).

(a) Insertion
(b) Merge
(c) Quick
(d) Bubble

Anurag Mishra Professor Asked on 12th March 2016 in General Knowledge.
Add Comment
  • 1 Answer(s)

    Answer: (c) Quick 

    Anurag Mishra Professor Answered on 12th March 2016.
    Add Comment
  • Your Answer

    By posting your answer, you agree to the privacy policy and terms of service.