×

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

Given/input an array, we have to sort an array in ascending order using quicksort.
By Nidhi Last updated : December 23, 2023

## Problem statement

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

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

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
```

### Explanation

In the above program, we imported the java.util.Scanner package to read the variable's value from the user. And, created a public class Main. It contains two static methods QuickSort() and main().

The QuickSort() is a recursive method, which is used to sort an array in ascending order.

The main() method is an entry point for the program. Here, we created an array. Then we used QuickSort() method to sort the array elements in ascending order using the quick sort technique and printed the updated array.

Comments and Discussions!

Student's Section
Subscribe

Copyright © 2024 www.includehelp.com. All rights reserved.