#include #include void stoogeSort(int a[],int first,int last); int main() { int array[14]= { 24,2,17,5,28,11,10,9,19,14,17,8,12,21 },n=14,i,test[3] = {2,1,3}; stoogeSort(array,0,n-1); for(i=0;ilast) return; if(first == last) return; if(a[first] > a[last]) { int temp = a[first]; a[first] = a[last]; a[last] = temp; //return; } if(last - first +1 >=3) { int oneThird = first + (last-first+2)/3; int twothird = last - (last-first+2)/3; stoogeSort(a,first,twothird); stoogeSort(a,oneThird,last); stoogeSort(a,first,twothird); } else return; }