For Wednesday Read Weiss, chapter 7, sections 4-6 Homework: - - PowerPoint PPT Presentation

for wednesday
SMART_READER_LITE
LIVE PREVIEW

For Wednesday Read Weiss, chapter 7, sections 4-6 Homework: - - PowerPoint PPT Presentation

For Wednesday Read Weiss, chapter 7, sections 4-6 Homework: Elementary sorting homework described on Blackboard in Notes and Homework. Programming Assignment 1 Any questions? Selection Sort Basic concept to the find the


slide-1
SLIDE 1

For Wednesday

  • Read Weiss, chapter 7, sections 4-6
  • Homework:

– Elementary sorting homework described on Blackboard in Notes and Homework.

slide-2
SLIDE 2

Programming Assignment 1

  • Any questions?
slide-3
SLIDE 3

Selection Sort

  • Basic concept to the find the smallest (or

largest) remaining element and put it in place.

slide-4
SLIDE 4

Insertion Sort

  • Basic concept:

– Conceptually split the list to be sorted into two parts: one that is sorted and one that is not – Repeatedly insert the first element from the unsorted part into the sorted part.

slide-5
SLIDE 5

Performance of Sorting

  • What is the performance?
  • Each sort would be the best choice (of the

simple sorts, at least) in certain situations— what situations?

  • What’s the space cost of these sorting

algorithms?

slide-6
SLIDE 6

Shellsort

  • What’s the concept?
  • h-sorting
  • increment sequence
  • Shell’s sequence {1, 2, 4, 8, …}
  • Hibbard’s sequence {1, 3, 7, 15, …}
  • best sequence known { 1, 5, 19, 41, 109,

…}

slide-7
SLIDE 7

Performance of Shellsort

slide-8
SLIDE 8

Heapsort

  • What’s the concept?
slide-9
SLIDE 9

Heapsort

  • Use max heaps instead of min heaps
  • Use BuildHeap to turn the array into a heap
  • Use deleteMax to remove items from the

beginning of the array, continually moving them to the end of the tree

slide-10
SLIDE 10

Performance of Heapsort