m10 - Lecture C10 Response to 'Muddiest Part of the Lecture...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture C10 Response to 'Muddiest Part of the Lecture Cards' (7 respondents) 1) Is insertion sort just bubble sort ? No. Both algorithms have a worst case complexity of O(n 2 ), but the insertions sort algorithm has a better best case complexity than the bubble sort algorithm. The insertion sort algorithm inserts each item directly into its proper place in the list. It does so by comparing the value to each item in the already sorted list by swapping place with the preceding element until it finds its proper place in the list. InsertionSort(A, n) for j in 2..n loop key:= A[j] i := j-1 while i > 0 and A[i] > key A[i+1]:= A[i] i:= i-1 A[i+1] end loop := key The bubble sort algorithm compares each item to the neighboring item and the items are swapped if needed. This process is repeated until a pass through the list does no longer generate any swaps between items. last := length; for I in 1 . . Last –1 loop for J in I+1 . . Last loop if List(I) < List(J) then swap list(i) and list(j) end if
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/28/2012 for the course AERO 16.01 taught by Professor Markdrela during the Fall '05 term at MIT.

Page1 / 3

m10 - Lecture C10 Response to 'Muddiest Part of the Lecture...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online