Insert Sort for objects : Sort Search « Collections Data Structure « Java

Insert Sort for objects

Insert Sort for objects
public class ObjectInsertSort {
  private Person[] a;

  private int nElems;

  public ObjectInsertSort(int max) {
    a = new Person[max];
    nElems = 0;

  // put person into array
  public void insert(String last, String first, int age) {
    a[nElems] = new Person(last, first, age);

  public void display() {
    for (int j = 0; j < nElems; j++)

  public void insertionSort() {
    int in, out;

    for (out = 1; out < nElems; out++) {
      Person temp = a[out]; // out is dividing line
      in = out; // start shifting at 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

  public static void main(String[] args) {
    int maxSize = 100; // array size
    ObjectInsertSort arr;
    arr = new ObjectInsertSort(maxSize); // create the array

    arr.insert("Jo", "Yin", 24);
    arr.insert("Pengzhou", "Yin", 59);
    arr.insert("James", "Chen", 37);
    arr.insert("Chirs", "Paul", 37);
    arr.insert("Rob", "Tom", 43);
    arr.insert("Carlo", "Sato", 21);
    arr.insert("Al", "Henry", 29);
    arr.insert("Nancy", "Jose", 72);
    arr.insert("Vang", "Minh", 22);

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

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

    System.out.println("After sorting:");
    arr.display(); // display them again

class Person {
  private String lastName;

  private String firstName;

  private int age;

  public Person(String last, String first, int a) {
    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() {
    return lastName;


Related examples in the same category

1.Linear search
2.Animation for quick sort
3.Quick Sort Implementation with median-of-three partitioning and cutoff for small arrays
4.Simple Sort DemoSimple Sort Demo
5.A simple applet class to demonstrate a sort algorithm
6.Sorting an array of StringsSorting an array of Strings
7.Simple version of quick sortSimple version of quick sort
8.Combine Quick Sort Insertion SortCombine Quick Sort Insertion Sort
9.Quick sort with median-of-three partitioningQuick sort with median-of-three partitioning
10.Fast Quick Sort
11.Selection sortSelection sort
12.Insert sortInsert sort
13.Bubble sortBubble sort
14.Merge sortMerge sort
15.Fast Merge Sort
16.Binary SearchBinary Search
17.Shell sortShell sort
18.Recursive Binary Search Implementation in Java
19.Topological sortingTopological sorting
20.Heap sortHeap sort
21.Sort NumbersSort Numbers
22.A quick sort demonstration algorithmA quick sort demonstration algorithm
23.Performing Binary Search on Java byte Array Example
24.Performing Binary Search on Java char Array Example
25.Performing Binary Search on Java double Array Example
26.Performing Binary Search on Java float Array Example
27.Performing Binary Search on Java int Array Example
28.Performing Binary Search on Java long Array Example
29.Performing Binary Search on Java short Array
30.Sort items of an array
31.Sort an array of objects
32.Sort a String array
33.Sort string array with Collator
34.Binary search routines
35.FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.
36.A binary search implementation.
37.Handles QuickSort and all of its methods.
38.Implements QuickSort three different ways
39.A quick sort algorithm to sort Vectors or arrays. Provides sort and binary search capabilities.A quick sort algorithm to sort Vectors or arrays. Provides sort and binary search capabilities.
40.Returns an array of indices indicating the order the data should be sorted in.