quick sort in c++ which can push the larger sub problem list into stack and then we pop that later
How to implement quick sort an array in c++?
#include%26lt;iostream%26gt;
using namespace std;
int main()
{
int ar[10]; //populate the array yourself
int i = 1;
while(i%26lt;10)
{
cout%26lt;%26lt;ar[i]%26lt;%26lt;endl;
i = i+2;
}
return 0;
}
http://cprogramming.com/
sd cards
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment