对结构数组进行冒泡排序

Question

我刚刚完成了一项任务，但最后一部分让我很生气。我做过研究，解决方案是我们在课堂上没有教过的概念，完全超出了我的想象。我需要冒泡排序和结构数组。但是我完全迷路了。任何帮助将不胜感激。

#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
}