void full_array(int *set,int size){
int j,k,tmp;
displayarray(set,size);
while((j=findj(set,size))!=-1){
k=minestmax_inright(set,j,size);
tmp=set[j];
set[j]=set[k];
set[k]=tmp;
reverse(set,j+1,size);
displayarray(set,size);
}
}
int main(int argc,char **argv){
char *arr[]={"bob","zeynab","alice","john"};
myQsort(arr,sizeof(arr)/sizeof(arr[0]));
displayarray(arr, sizeof(arr)/sizeof(arr[0]));
return 0;
}
main()
{
int size_local;
double most, least;
double price_list[MAX_PRICES];
printf("\nPrices Before Sorting of Array:");
readarray(price_list, &size_local);
sortarray(price_list, size_local, &most, &least);
printf("\n\nPrices After Sorting of Array:");
displayarray(price_list, size_local);
printf("\n");
display(most, least);
}
