Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Change objectSort.java such that use selection and Bubble sort instead of insertion sort. // objectSort.java // demonstrates sorting objects (uses insertion sort) // to run

Change objectSort.java such that use selection and Bubble sort instead of insertion sort.

// objectSort.java // demonstrates sorting objects (uses insertion sort) // to run this program: C>java ObjectSortApp //////////////////////////////////////////////////////////////// class Person { private String lastName; private String firstName; private int age; //----------------------------------------------------------- public Person(String last, String first, int a) { // constructor lastName = last; firstName = first; age = a; } //----------------------------------------------------------- public void displayPerson() { System.out.print(" Last name: " + lastName); System.out.print(", First name: " + firstName); System.out.println(", Age: " + age); } //----------------------------------------------------------- public String getLast() // get last name { return lastName; } } // end class Person //////////////////////////////////////////////////////////////// class ArrayInOb { private Person[] a; // ref to array a private int nElems; // number of data items //-------------------------------------------------------------- public ArrayInOb(int max) // constructor { a = new Person[max]; // create the array nElems = 0; // no items yet } //-------------------------------------------------------------- // put person into array public void insert(String last, String first, int age) { a[nElems] = new Person(last, first, age); nElems++; // increment size } //-------------------------------------------------------------- public void display() // displays array contents { for(int j=0; j

for(out=1; out

while(in>0 && // until smaller one found, a[in-1].getLast().compareTo(temp.getLast())>0) { a[in] = a[in-1]; // shift item to the right --in; // go left one position } a[in] = temp; // insert marked item } // end for } // end insertionSort() //-------------------------------------------------------------- } // end class ArrayInOb //////////////////////////////////////////////////////////////// class ObjectSortApp { public static void main(String[] args) { int maxSize = 100; // array size ArrayInOb arr; // reference to array arr = new ArrayInOb(maxSize); // create the array

arr.insert("Evans", "Patty", 24); arr.insert("Smith", "Doc", 59); arr.insert("Smith", "Lorraine", 37); arr.insert("Smith", "Paul", 37); arr.insert("Yee", "Tom", 43); arr.insert("Hashimoto", "Sato", 21); arr.insert("Stimson", "Henry", 29); arr.insert("Velasquez", "Jose", 72); arr.insert("Vang", "Minh", 22); arr.insert("Creswell", "Lucinda", 18);

System.out.println("Before sorting:"); arr.display(); // display items

arr.insertionSort(); // insertion-sort them

System.out.println("After sorting:"); arr.display(); // display them again } // end main() } // end class ObjectSortApp ////////////////////////////////////////////////////////////////

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Excel As Your Database

Authors: Paul Cornell

1st Edition

1590597516, 978-1590597514

More Books

Students also viewed these Databases questions