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

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

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

• [A] 16
• [B] 12
• [C] 6
• [D] 10

• [A] X
• [B] null
• [C] s
• [D] none of these

• [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