Sorting struct array

[vikerneso]

I'm trying to sort an array of structs. My code looks something like this:

struct Foo
{
    int number;
};
 
int main()
{
    int i = 14;
    Foo *floo = new Foo[i];
}
 

Are there any functions for this kind of sorting in the standard library? I've found a code for bubble sort, but I'm not sure how to pass a struct array to it.

void bubble_sort(apvector <int> &array)
{
      int i, j, flag = 1;
      int temp;
      int arrayLength = array.length( ); 
      for(i = 1; (i <= arrayLength) && flag; i++)
     {
          flag = 0;
          for (j=0; j < (arrayLength -1); j++)
         {
               if (array[j+1] > array[j])
              { 
                    temp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = temp;
                    flag = 1;
               }
          }
     }
}
 

This is the code I found, but as I said, I don't know how to pass a struct array to it. If I try floo[j+1].number I get an error.
Also, I don't want to rearrange them sorted (like in the code above) but put them sorted into another array.

[willakawill]

Hi. You should copy to the array that you want to be sorted and pass that to your sort algorithm. This is a version of heap sort that I have adjusted to fit the struct you used as an example. This will work for any array of any struct. You just need to replace the type, Foo, with the struct type and the element, number, with the struct element that you wish to sort with.

void HeapSort(Foo* list)
{
   long size = sizeof(list) / sizeof(list[0]);
   Foo tmp;
 
   for(long i = size/2; i > 0;) Heapify(list, --i, size);
 
   for(long i = size-1; i>0; --i)
   {
      tmp = list[0];
      list[0] = list[i];
      list[i] = tmp;
      Heapify(list, 0, i);
   }
}
 
void Heapify(Foo* A, long i, long heapsize)
{
   while(true)
   {
      long l = 2*i+1;
      long r = 2*i+2;
 
      long largest = (l < heapsize && A[i]->number < A[l]->number) ? l : i;
 
      if(r < heapsize && A[largest]->number < A[r]->number)
         largest = r;
 
      if(largest != i)
      {
         foo tmp;
         tmp = A[i];
         A[i] = A[largest];
         A[largest] = tmp;
         i = largest;
      }
      else break;
    }
}

[vikerneso]

Sorry for such a late reply. Just wanted to say thanks, it worked.