Quick sort algorithm implementation in java

As the name, quick sort is the most quick algorithm to sort some number. There are some other sorting algorithm like bucket sort, insertion sort, bubble sort, radix sort etc. Among them, quick sort is very efficient.
Here is the step diagram of quick sort:

Let's look at the code:

import java.util.Scanner ;
 public class MyQuick {
  private int ar[] ;
  private int length ;
  private static Scanner w ;
  public static void main(String[] args) {
    w = new Scanner(System.in) ;
    int i,n ;
    System.out.println("Numbers of elements : ");
    n = w.nextInt() ;
    int [] a = new int [n] ;
    System.out.println("Elements are : ");
    for(i = 0; i < n; i++)
    {
     a[i] = w.nextInt() ;
         }
    MyQuick quick = new MyQuick () ;
    quick.Sort(a) ;
    System.out.println("After sorting the elements are :");
    for(int q : a)    {
      System.out.println(q);
    }
  }
  public void Sort(int [] a)
  {
   this.ar = a ;
   this.length = a.length ;
   QuickSort(0,length - 1) ;
   if(ar == null || ar.length == 0)
   {
    return ;
   }
  }
  private void QuickSort(int low, int high)  {
   int i = low ;
   int j = high ;   //calculate pivot number , i m talking pivot as middle index number
   int pivot = ar [low + (high - low) / 2] ;   //divide into two arrays
   while(i <= j)
   {
    while(ar[i] < pivot)
    {
     i++ ;
    }
    while(ar[j] > pivot)
    {
     j-- ;
    }
    if(i <= j)
    {
     Exchange(i,j) ;
     //move index to nest position on both sides
     i++ ;
     j-- ;
    }
   }
   //call quicksort method recursively
   if(low < j)
   {
    QuickSort(low,j) ;
   }
   if(i < high)
   {
    QuickSort(i,high) ;
   }
  }
  private void Exchange(int i, int j)
  {
   int temp = ar[i];
   ar[i] = ar[j] ;
   ar[j] = temp ;
  }
     }

Happy Coding...

bucket sort insertion sort bubble sort

radix sort Binary search in java Binary search in C

Quick sort algorithm implementation in java As the name, quick sort is the most quick algorithm to sort some number. There are some other sorting algorithm like bucket sort, insertion sort, bubble sort, radix sort etc. Among them, quick sort is very efficient. Here is the step diagram of quick sort.Quick sort algorithm implementation in java

Labels

Look Through

Quick sort algorithm implementation in java