In this program, we will create an array of integers then we will sort array elements in ascending order using quicksort.

Program/Source Code:

The source code to sort an array in ascending order using quicksort is given below. The given program is compiled and executed successfully.

// Java program to sort an array in ascending order 
// using quicksort

import java.util.Scanner;

public class Main {
  static void QuickSort(int arr[], int first, int last) {
    int pivot = 0;
    int temp = 0;
    int i = 0;
    int j = 0;

    if (first < last) {
      pivot = first;
      i = first;
      j = last;

      while (i < j) {
        while (arr[i] <= arr[pivot] && i < last) {
          i = i + 1;
        }
        while (arr[j] > arr[pivot]) {
          j = j - 1;
        }

        if (i < j) {
          temp = arr[i];
          arr[i] = arr[j];
          arr[j] = temp;
        }
      }

      temp = arr[pivot];
      arr[pivot] = arr[j];
      arr[j] = temp;

      QuickSort(arr, first, j - 1);
      QuickSort(arr, j + 1, last);
    }
  }

  public static void main(String[] args) {
    Scanner SC = new Scanner(System.in);

    int i = 0;
    int j = 0;
    int t = 0;

    int arr[] = {14, 49, 79, 87, 78};

    QuickSort(arr, 0, arr.length - 1);

    System.out.println("Sorted Array in ascending order: ");
    i = 0;
    while (i < 5) {
      System.out.print(arr[i] + " ");
      i = i + 1;
    }
  }
}

Output:

Sorted Array in ascending order: 
14 49 78 79 87