GATE 2012 Which one of the following is the tightest upper

0

GATE 2012
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?

(A) O(log n)
(B) O(n) (C)
O(n log n)
(D) O(n2)

Ravi Garg edited question
    Add image to editor add image from link

    Question stats

    • Active
    • Views76 times
    • Answers0 answers
    • Followers1 follower
    Question and answer is powered by AnsPress