In the bubble sort algorithm, which code accomplishes swapping values in elements at positions index and index + 1? A. list[index] = list[index + 1] list[index + 1] = list[index] B. list[index] = temp; list[index] = list[index + 1]; temp = list[index + 1]; C. temp = list[index]; list[index] = list[index + 1]; list[index + 1] = temp; D. list[index + 1] = list[index] list[index] = list[index + 1]

Question

Computers & Technology

Bradley Daugherty

17 June, 08:03

In the bubble sort algorithm, which code accomplishes swapping values in elements at positions index and index + 1? A. list[index] = list[index + 1] list[index + 1] = list[index] B. list[index] = temp; list[index] = list[index + 1]; temp = list[index + 1]; C. temp = list[index]; list[index] = list[index + 1]; list[index + 1] = temp; D. list[index + 1] = list[index] list[index] = list[index + 1]

+3

Answers (1)

Know the Answer?

Marianna Haney · Answer 1

Option (C)

Explanation:

While swapping two values, we need a temporary variable which needs to store the intermediate value. In bubble sort, in each pass we swap values if smaller element is found at advanced index. So, value at lower index is stored at temp variable and value of higher index is stored at lower one and then finally value at temp is stored at higher index.

Other options are wrong as they did not follow the sequence of swapping.