冒泡排序一个结构数组

Bubble Sort an Array of Structs

本文关键字：一个 结构 数组 冒泡排序      更新时间：2023-10-16

我马上就要完成作业了，但是最后这部分太难了。我做了研究，解决方案是我们在课堂上没有教过的概念，完全超出了我的理解。我需要冒泡排序和数组的结构。然而，我完全迷路了。如有任何帮助，我将不胜感激。

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

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
}
相关文章：