氣泡排序結構數組

Question

我剛剛完成作業，但最後一節正在殺死我。我已經完成了研究，解決方案是我們在課堂上沒有教過的概念，並且完全凌駕於我的頭上。我需要bubbleSort和結構數組。但是我完全失去了。任何幫助將不勝感激。

#include "stdafx.h" 
#include <iostream> 
#include <fstream> 
#include <string> 
#include <algorithm> 

struct billingInfo; 
void bubbleSort(billingInfo list[], int length); 
using namespace std; 

int main() 
{ 
    // create struct with a field for zip codes and name of recepients that are being imported from text document 
     struct billingInfo { 
     int zipCode; 
     string name; 
    }; 

    // create array of billingInfo struct 
    billingInfo recipients[20]; 

    // open text file and test if file opened 
    ifstream dataFile("NameZip.txt"); 

    if (dataFile.fail()) 
     cout << "Can't open file." << endl; 
    else cout << "File opened." << endl; 

    int numElements = 0; 
    while (dataFile.peek() != EOF) { 
     dataFile >> recipients[numElements].zipCode; 
     getline(dataFile, recipients[numElements].name); 

     cout << recipients[numElements].zipCode << endl; 
     cout << recipients[numElements].name << endl; 
     numElements++; 
    } 

    system("pause"); 

    return 0; 
} 

void bubbleSort(billingInfo list[], int length) { 
    billingInfo temp; 
    int itterator; 
    int index; 
    for (itterator = 1; itterator < length - itterator - length; itterator++) { 
     for (index = 0; index < length - itterator; index++) { 
      temp = list[index]; 
      list[index] = list[index + 1]; 
      list[index + 1] = temp; 
     } 
    } 
    enter code here 

} 

Answer 1

struct billingInfo 
{ 
    int key; // Can be any key 

}; 
typedef struct billingInfo billingInfo; 

// Overload the > operator 
bool operator> (const billingInfo& first,const billingInfo& second) 
{ 
    return first.key > second.key; 
} 

// Make a custom Swap function for your struct 
void swap (billingInfo& first,billingInfo& second) 
{ 
    int temp; 
    temp = first.key; 
    first.key = second.key; 
    second.key = temp; 
} 

// Not a single line of change in Bubble Sort Code. 
// I hope the below code is bubble sort :p 
void bubble_sort (billingInfo *list,int length) 
{ 
    for (int i=0;i<length-1;i++) 
     for (int j=0;j<length-i-1;j++) 
      if (list[j] > list[j+1]) // will work since we overloaded 
       swap (list[j],list[j+1]); // Our custom function 
}