MCPcopy Create free account
hub / github.com/Lakhankumawat/LearnCPP / Quick_sort

Function Quick_sort

S-SortingAlgorithms/QuickSort.cpp:45–54  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

43
44
45void Quick_sort(int *A,int low,int high){
46if(low<high){ //More than one element -base condition
47 int p=partition(A,low,high);
48
49 Quick_sort(A,low,p-1);
50 Quick_sort(A,p+1,high);
51
52
53}
54}
55
56void Print(int *A,int n){
57 for (int i = 0; i < n; i++)

Callers 1

mainFunction · 0.85

Calls 1

partitionFunction · 0.85

Tested by

no test coverage detected