sorting - OriginalVector:[63011275313]...

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

View Full Document Right Arrow Icon
Original Vector: [6   30   11   2   7   5   3   13] Insertion Sort (BigO: N 2 [  ] [6] [6   30] [6   11   30] [2   6   11   30] [2   6   7   11   30] [2   5   6   7   11   30] [2   3   5   6   7   11   30] [2   3   5   6   7   11   13   30] Quick Sort (BigO: N*log(N)) [2   5   3] [6] [30   11   7   13] % where [6] is the pivot. Any numbers less 6  than go to the left, bigger than 6 go to the right. [] [2] [5   3] [6] [11   7   13] [30] [] % [2] is the new pivot on the left and [30] is the  new pivot on the right. [2] [3] [5] [] [6] [7] [11] [13] [30] % [5] and [11] are the new pivots on the left and  right respectively. Merge Sort (BigO: N*log(N)) [6   30   11   2   7   5   3   13]  [6   30   11   2] [7   5   3   13] [6   30] [11   2] [7   5] [3   13]
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 04/19/2010 for the course CS 1371 taught by Professor Stallworth during the Fall '08 term at Georgia Tech.

Page1 / 2

sorting - OriginalVector:[63011275313]...

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