算法导论水壶问题（第三版第八章思考题8-4）

算法导论水壶问题

（第三版第八章思考题8-4）
本算法只适用于解题，不通用。
期望的时间复杂度O（nlgn）
Kettle.h文件

#ifndef C11LEARN_KETTLE_H
#define C11LEARN_KETTLE_H

#include <iostream>
#include <vector>
#include "../tools/random.h"
using namespace std;
class Kettle {
public:
    string color;
    float size;
    int identifier;
public:
    Kettle(string color,float size,int identifier);
    Kettle();
};
void matching_kettle(vector<Kettle> red,vector<Kettle> blue);

#endif //C11LEARN_KETTLE_H

Kettle.cpp文件

#include "Kettle.h"
Kettle::Kettle(string color,float size,int identifier):color(color),size(size),identifier(identifier){};
Kettle::Kettle(){};
int quick_sort_partition(vector<Kettle>& red,vector<Kettle>& blue,int start,int end)
{
    int random = random_include_left_right(start,end);
    Kettle key = red[random];
    red[random] = red[end];
    red[end] = key;
    Kettle temp;
    int less_line = start - 1;
    for (int i = start; i < end; ++i) {
        if(blue[i].size < key.size)
        {
            less_line++;
            temp = blue[i];
            blue[i] = blue[less_line];
            blue[less_line] = temp;
        }
        else if(blue[i].size == key.size)
        {
            temp = blue[end];
            blue[end] = blue[i];
            blue[i] = temp;
            i--;
        }
    }
    key = blue[end];
    blue[end] = blue[less_line+1];
    blue[less_line+1] = key;
    temp = red[less_line+1];
    red[less_line+1] = red[end];
    red[end] = temp;

    less_line = start - 1;
    for (int i = start; i < end; ++i) {
        if(red[i].size < key.size)
        {
            less_line++;
            temp = blue[i];
            red[i] = red[less_line];
            red[less_line] = temp;
        }
    }
    return less_line + 1;
}
void matching_kettle(vector<Kettle>& red,vector<Kettle>& blue,int start,int end){
    if(start<end)
    {
        int k = quick_sort_partition(red,blue,start,end);
        matching_kettle(red,blue,start,k-1);
        matching_kettle(red,blue,k+1,end);
    }
}
void matching_kettle(vector<Kettle> red,vector<Kettle> blue){
    matching_kettle(red,blue, 0,red.size()-1);
}