2021.6.14 数据结构 起泡排序 快速排序(int 数组)
运行截图:
代码:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<stdlib.h>
using namespace std;
#define NSIZE 8
//冒泡排序
void InserSort(int arr[NSIZE])
{
int i, j;
for (i = 2; i < NSIZE; ++i)
{
if (arr[i]< arr[i - 1])
{
arr[0] = arr[i];
arr[i] = arr[i - 1];
for (j = i - 2; arr[0] < arr[j]; --j)
{
arr[j + 1] = arr[j];
}
arr[j + 1] = arr[0];
}
}
}
//快速排序
void QuickSort(int left, int right)
{
int a[NSIZE];
int i, j, t, temp;
if (left > right)
return;
temp = a[left];
i = left;
j = right;
while (i != j)
{
while (a[j] >= temp && i < j)
{
j--;
}
while (a[i] <= temp && i < j)
{
i++;
}
if (i < j)
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
a[left] = a[i];
a[i] = temp;
QuickSort(left, i - 1);
QuickSort(i + 1, right);
}
int main()
{
int i = 0, j, t, count = 0;
int T=8;
int arr[NSIZE - 1];
printf("请输入需排序的数组:\n");
while (T--)
{
scanf_s("%d", &arr[i]);
i++;
}
printf("\n");
InserSort(arr);
printf("起泡排序后:\n");
for (j = 1; j < NSIZE; j++)
printf("%d ", arr[j]);
printf("\n");
QuickSort(0, i - 1);
printf("快速排序后:\n");
for (t = 1; t < NSIZE; t++)
printf("%d ", arr[t]);
return 0;
}