quicksort

[ad_1] Here it’s done with std::sort from the header algorithm #include <iostream> #include <string> #include <algorithm> #include <vector> int main(){ std::vector<std::string> nums{ “922003001020293839297830207344987344973074734”, “766352786207892397340783784078348747606208602”, “182823068326283756515117829362376823572395775” }; std::cout << “unsorted: ” << std::endl; for (auto i : nums){ std::cout << i << std::endl; } std::sort(nums.begin(), nums.end()); //sort it std::cout << “\nsorted: ” << std::endl; for (auto … Read more

[ad_1] Actually I could not find the exact problem in your program, but if you want a program to perform quicksort on an array of elements, this is it: #include<stdio.h> void quicksort(int [10],int,int); int main(){ int x[20],size,i; printf(“Enter size of the array: “); scanf(“%d”,&size); printf(“Enter %d elements: “,size); for(i=0;i<size;i++) scanf(“%d”,&x[i]); quicksort(x,0,size-1); printf(“Sorted elements: “); for(i=0;i<size;i++) … Read more