Chapter 18
Upcoming SlideShare
Loading in...5

Chapter 18






Total Views
Views on SlideShare
Embed Views



0 Embeds 0

No embeds



Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
Post Comment
Edit your comment

    Chapter 18 Chapter 18 Presentation Transcript

    • Sorting Chapter 18
    • 18 Creating Sortable Objects Objects are sortable when they implement the Comparable interface. Must implement compareTo() method Programmer must decide how to compare objects.
    • 18 Sorting Arrays TreeSet collections are sorted by default. Arrays class includes a sort() method. Items in array must be sortable (implement the Comparable interface).
    • 18 Sorting Algorithms Sortable interface Provides framework for sort classes Defines what it means to be sortable SortList class Holds the items in the list in an internal ArrayList Tracks: Number of items in the list Number of comparisons Number of exchanges Indicates whether algorithm steps should be displayed
    • 18 The Nested SortItem Class SortItem class: Implements Comparable interface Uses the compareTo() method to compare current object to an object passed in Uses the exchangeValues() method to exchange values when required
    • 18 Sorting Algorithms SortDriver class: Creates a sort object and submits a list to test the algorithm Will be modified several times as new sort algorithm classes are created SortAlgorithm class: Abstract base class (used to derive all sort algorithm classes) Provides common methods used by all the sort algorithms
    • 18 Insertion Sort Recursive insertion: Compare new object to each object in the list until you find one of lesser value. Requires a lot of comparisons and exchanges.
    • 18 Shell Sort The shell sort is a variation on the insertion sort. Divides list into smaller sublists Sorts each sublist individually Then sorts sublists together Requires many comparisons, but fewer exchanges
    • 18 Selection Sort Selection sort: Scans list to find lowest value then moves it to the left Repeat to find next lowest value Many comparisons with minimal exchanges
    • 18 Bubble Sort Bubble sort: Compares each item to its neighbor and exchanges if necessary Largest items “bubble” to the top Poor performance due to many comparisons and many exchanges
    • 18 Quicksort Most widely used sort method Partitions the list Use “pivot” to create right and left side Move item from left to right if larger than pivot Move item from right to left if smaller than pivot Each side is then partitioned and algorithm recurses until list is sorted
    • 18 Comparison of Sort Algorithms Direct comparison using random values