6 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 428
Correct 62
Incorrect 136
Viewed 230

Answers

Guest
Guest
Abdelrahman S. Fathy
Abdelrahman S. Fathy - 3 months ago

Abdelrahman S. Fathy from Cairo, Egypt is saying 13 is correct answer

Sanju Rebel
Sanju Rebel - 6 months ago

Sanju Rebel from Hyderabad, India is saying 13 is correct answer

yogender kumar
yogender kumar - 7 months ago

yogender kumar from New Delhi, India is saying 12 is correct answer

Serkie Mekonnen
Serkie Mekonnen - 8 months ago

Serkie Mekonnen from Dessie, Ethiopia is saying 11 is correct answer

Marem Husen
Marem Husen - 9 months ago

Marem Husen from Al Musayyib, Iraq is saying 14 is correct answer

Related Questions

An IP address is a numeric quantity that identifies -

  • [A] a network adapter to other devices on the network
  • [B] the manufacturer of a computer
  • [C] the physical location of a computer
  • [D] none of the above

View Answer

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

View Answer

Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?

  • [A] 3,4,5,1,2
  • [B] 3,4,5,2,1
  • [C] 1,5,2,3,4
  • [D] 5,4,3,1,2

View Answer

What is data structure?


View Answer

Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

  • [A] mn
  • [B] max(m,n)
  • [C] min(m,n)
  • [D] m+n-1

View Answer