【八大数据排序法】合并排序法的图形理解和案例实现 | C++

#include<iostream>
using namespace std;
//事先声明排序数据的个数
#define size_1 6 
#define size_2 6
class sort{
public:
  int data_1[size_1];
  int data_2[size_2];
  int data_3[size_1 + size_2];
  void showresult(int len,int data[]) {
  for (int i = 0; i < len; i++)
    cout << data[i] << " ";
  cout <<  endl;
  }
};
class quick :public sort {
public:
  void quick_start(int left, int right,int data[]) {
  int left_idx, right_idx;
  int temp;
  if (left < right)
  {
    left_idx = left + 1;
    right_idx = right;
    while (1)
    {
    //从左向右扫描，找出一个键值大于data[left]的数据元素
    for (int i = left + 1; i <= right; i++)
    {
      if (data[i] > data[left])
      {
      left_idx = i;
      break;
      }
      left_idx++;
    }
    //从右向左扫描，找出一个键值小于data[left]的数据元素
    for (int j = right; j >= left + 1; j--)
    {
      if (data[j] < data[left])
      {
      right_idx = j;
      break;
      }
      right_idx--;
    }
    //如果left_idx<right_idx，将二者交换位置
    if (left_idx < right_idx) {
      temp = data[left_idx];
      data[left_idx] = data[right_idx];
      data[right_idx] = temp;
    }
    else {
      break;
    }
    }
    //如果left_idx>=right_idx
    if (left_idx >= right_idx)
    {
    //将data[left]与data[right_idx]交换位置
    temp = data[left];
    data[left] = data[right_idx];
    data[right_idx] = temp;
    //以递归的方式继续进行左半的快速排序
    quick_start(left, right_idx - 1,data);
    //以递归的方式继续进行右半的快速排序
    quick_start(right_idx + 1, right,data);
    }
  }
  }
};
class merge :public sort {
public:
  void merge_start(int data_1[],int data_2[],int data_3[]) {
  int i = 0, j = 0, k = 0;
  //进行数据的合并排序
  while (i<size_1&&j<size_2)
  {
    if (data_1[i] <= data_2[j])
    data_3[k++] = data_1[i++];
    else
    data_3[k++] = data_2[j++];
  }
  //再次检查判断,是否合并完成
  while (i < size_1)
    data_3[k++] = data_1[i++];
  while (j < size_2)
    data_3[k++] = data_2[j++];
  }
};
void text()
{
  sort s;
  quick q;
  merge g;
  cout << "请输入数列1中的" << size_1 << "个数据：";
  for (int i = 0; i < size_1; i++)
  cin >> s.data_1[i];
  cout << "请输入数列2中的" << size_2 << "个数据：";
  for (int i = 0; i < size_2; i++)
  cin >> s.data_2[i];
  //先利用最佳的快速排序法对两组数据进行分别排序
  q.quick_start(0,size_1-1,s.data_1);
  q.quick_start(0,size_2-1,s.data_2);
  cout << "排序后的数列1:"; s.showresult(size_1, s.data_1);
  cout << "排序后的数列2:"; s.showresult(size_2, s.data_2);
  //再利用合并排序法去将1，2两个数据列合并到数据列3中
  g.merge_start(s.data_1,s.data_2,s.data_3);
  cout << "合并后的数列："; s.showresult(size_1 + size_2,s.data_3);
}
int main()
{
  text();
}