Pseudocode for the logic of Bubble Sort +--------------------------------------+

Question

 Pseudocode for the logic of Bubble Sort         +--------------------------------------+          For lastPosition = last subscript in the array, decremented down to 0                 For index =0 up through lastPosition -1                         If array[index] > array[index+1]                                 Swap array[index] with array[index+1]                         End If                 End For         End For                  Pseudocode for the logic of Insertion Sort         +-----------------------------------------+          For index equals each subscript in array from 1 through the last subscript                 Save the value in index in scan                 Save the value in array[index] in unsortedValue                      While scan is greater than 0 and array[scan-1] is greater than unsortedValue                         Move array[scan -1] to array[scan]                         Subtract 1 from scan                 End While                 Store the value in unsortedValue in array[scan]         End For 

Explanation / Answer

Bubble sort Code In C:

InsertionSort Code in C:

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.