Quicksort for arraylist

public static ArrayList<Vehicle> quickSort(ArrayList<Vehicle> list)
{
    if (list.isEmpty()) 
        return list; // start with recursion base case
    ArrayList<Vehicle> sorted;  // this shall be the sorted list to return, no needd to initialise
    ArrayList<Vehicle> smaller = new ArrayList<Vehicle>(); // Vehicles smaller than pivot
    ArrayList<Vehicle> greater = new ArrayList<Vehicle>(); // Vehicles greater than pivot
    Vehicle pivot = list.get(0);  // first Vehicle in list, used as pivot
    int i;
    Vehicle j;     // Variable used for Vehicles in the loop
    for (i=1;i<list.size();i++)
    {
        j=list.get(i);
        if (j.compareTo(pivot)<0)   // make sure Vehicle has proper compareTo method 
            smaller.add(j);
        else
            greater.add(j);
    }
    smaller=quickSort(smaller);  // capitalise 's'
    greater=quickSort(greater);  // sort both halfs recursively
    smaller.add(pivot);          // add initial pivot to the end of the (now sorted) smaller Vehicles
    smaller.addAll(greater);     // add the (now sorted) greater Vehicles to the smaller ones (now smaller is essentially your sorted list)
    sorted = smaller;            // assign it to sorted; one could just as well do: return smaller

    return sorted;
}

Source: stackoverflow.com

Similar codes

33 votes280 views2 answers
Allow internet permission android
Java
0 vote277 views2 answers
Kotlin dependency injection
Java
2 votes367 views1 answer
Spring mvc get all request parameters
Java Spring
29 votes309 views9 answers
Traduttore
Java
6 votes310 views1 answer
Java int to binary
Java
0 vote301 views1 answer
Java how to use log
Java
0 vote322 views1 answer
Aggregation in java
Java
6 votes278 views1 answer
Android studio webview mailto
Java
0 vote267 views1 answer
Builtin calculator for edittext
Java
7 votes256 views1 answer
How to reverse order of arraylist
Java