Simple Quick Sort - Hackerrank Problem Solution

Simple Quick Sort

Hackerrank Problem Solution

PROBLEM STATEMENT

Quick sort is a highly efficient sorting algorithm and is based on Divide and Conquer. You are given an array of integers in any order. Sort the elements of given array in ascending order using quick sort.

Input Format

The first line contains an integer, n , the size of the array

The second line contains n space-separated integers a[i].

Constraints

2<=n<=600 1<=a[i]<=2*10^6

Output Format

Array is sorted and printed in ascending order in one line.

Sample Input 0

5
1 2 3 4 5

Sample Output 0

1 2 3 4 5

---

SOLUTION

#include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int partition(int arr[],int low,int high) { int t,t2; int pivot=arr[high]; int i=(low-1); for(int j=low;j<=high-1;j++) { if(arr[j]<=pivot) { i++; t=arr[i]; arr[i]=arr[j]; arr[j]=t; } } t2=arr[i+1]; arr[i+1]=arr[high]; arr[high]=t2; return i+1; } void quicksort(int arr[],int low,int high) { if(low<high) { int test=partition(arr,low,high); quicksort(arr,low,test-1); quicksort(arr,test+1,high); } } int main() { int i,n; int arr[100]; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&arr[i]); quicksort(arr,0,n-1); for(i=0;i<n;i++) printf("%d ",arr[i]); /* Enter your code here. Read input from STDIN. Print output to STDOUT */ return 0; }

Share Share Tweet Share Share Share

LIKE?

SHARE If you find this useful, please share with your friends and Community.
CODE TOGETHER..GROW TOGETHER.