C / C++ / MFC

Babylon Lion wrote:

Can you guys provide some explanation please?

for (i = 0; i < length; i++)

for (i = 0; i < length-1; i++)

Babylon Lion wrote:

whenever a comparison like that is required, a bubble function is used, right?

void swap(int *x,int *y) 
{ 
  int temp; 
  temp = *x; 
  *x = *y; 
  *y = temp; 
}

int choose_pivot(int i,int j ) 
{ 
  return((i+j) /2); 
} 

void quicksort(int list[],int m,int n) 
{ 
  int key,i,j,k; 
  if( m < n) 
  { 
    k = choose_pivot(m,n); 
    swap(&list[m],&list[k]); 
    key = list[m]; 
    i = m+1; 
    j = n; 
    while(i <= j) 
    { 
      while((i <= n) && (list[i] <= key)) 
      i++; 
      while((j >= m) && (list[j] > key)) 
      j--; 
      if( i < j) 
        swap(&list[i],&list[j]); 
    } 
// swap two elements 
    swap(&list[m],&list[j]); 
// recursively sort the lesser list 
    quicksort(list,m,j-1); 
    quicksort(list,j+1,n); 
    } 
} 

danataylor wrote:

QuickSort is infinitely faster than a bubble sort

«_Superman_» wrote:

I would recommend the use of the functions from the standard library like qsort or qsort_s.