Davinder Singh
Davinder Singh - 4 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...

Overall Stats

Attempted 381
Correct 52
Incorrect 110
Viewed 219

Answers

Guest
Guest
Mital Patel
Mital Patel - 1 month ago

Mital Patel from Ahmedabad, India is saying 14 is correct answer

Jawad Awan
Jawad Awan - 7 months ago

Jawad Awan from Jamshoro, Pakistan is saying 14 is correct answer

Mayank Pathak
Mayank Pathak - 8 months ago

Mayank Pathak from Muzaffarpur, India is saying 14 is correct answer

akanksha singh
akanksha singh - 8 months ago

akanksha singh from Vadodara, India is saying 14 is correct answer

monika
monika - 8 months ago

monika from India is saying 12 is correct answer

Related Questions

Davinder Singh
Davinder Singh - 4 years ago in Data Structure
Sparse matrices have ?
  • [A] no zero
  • [B] many zero
  • [C] higher dimenstion
  • [D] none
Davinder Singh
Davinder Singh - 4 years ago in Data Structure
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
  • [A] 2 deletions and 3 additions
  • [B] 3 additions and 2 deletions
  • [C] 3 deletions and 3 additions
  • [D] 3 deletions and 4 additions
  • Deepali Nimje
Davinder Singh
Davinder Singh - 4 years ago in Data Structure
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