7 years ago in Data Structure

The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?

[A] 11
[B] 12
[C] 13
[D] 14
Loading...
Next Question

Overall Stats

Attempted 277
Correct 38
Incorrect 78
Viewed 161

Answers

Guest
Guest
Lets Know
Lets Know - 4 years ago

Lets Know from Pakistan is saying 14 is correct answer

Baerov Bogdan
Baerov Bogdan - 4 years ago

Baerov Bogdan from Mogosoaia, Romania is saying 13 is correct answer

Rohan Bhosale
Rohan Bhosale - 4 years ago

Rohan Bhosale from Pune, India is saying 12 is correct answer

Mihir Shah
Mihir Shah - 4 years ago

Mihir Shah from Majalgaon, India is saying 12 is correct answer

Sangeetha A
Sangeetha A - 4 years ago

Sangeetha A from Chennai, India is saying 12 is correct answer

Related Questions

Which of the following algorithm design technique is used in the quick sort algorithm?

  • [A] Dynamic programming
  • [B] Backtracking
  • [C] Divide and conquer
  • [D] Greedy method

Queue can be used to implement ?

  • [A] quick sort
  • [B] merge sort
  • [C] heap sort
  • [D] insertion sort

Sparse matrices have ?

  • [A] no zero
  • [B] many zero
  • [C] higher dimenstion
  • [D] none