Stack.h
#pragma once
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<stdbool.h>
// 支持动态增长的栈
typedef int STDataType;
typedef struct Stack
{
STDataType* a;
int top; // 栈顶
int capacity; // 容量
}Stack;// 初始化栈
void StackInit(Stack* ps);// 入栈
void StackPush(Stack* ps, STDataType data);// 出栈
void StackPop(Stack* ps);// 获取栈顶元素
STDataType StackTop(Stack* ps);// 获取栈中有效元素个数
int StackSize(Stack* ps);// 检测栈是否为空,如果为空返回非零结果,如果不为空返回0
int StackEmpty(Stack* ps);// 销毁栈
void StackDestroy(Stack* ps);
Stack.c
#include"stack.h"
void StackInit(Stack* ps)
{
assert(ps);ps->a = NULL;
ps->top = 0;
ps->capacity = 0;
}void StackPush(Stack* ps, STDataType data)
{
assert(ps);//扩容
if (ps->top == ps->capacity)
{
int newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
STDataType* tmp = (STDataType*)realloc(ps->a, sizeof(STDataType) * newcapacity);
if (tmp == NULL)
{
perror("realloc");
return;
}
ps->a = tmp;
ps->capacity = newcapacity;
}ps->a[ps->top] = data;
ps->top++;
}void StackPop(Stack* ps)
{
assert(ps);
// 不为空
assert(ps->top > 0);ps->top--;
}STDataType StackTop(Stack* ps)
{
assert(ps);
// 不为空
assert(ps->top > 0);return ps->a[ps->top - 1];
}int StackSize(Stack* ps)
{
assert(ps);return ps->top;
}int StackEmpty(Stack* ps)
{
assert(ps);
/*if (pst->top == 0)
{
return true;
}
else
{
return false;
}*/
return ps->top == 0;
}void StackDestroy(Stack* ps)
{
assert(ps);free(ps->a);
ps->a = NULL;
ps->top = ps->capacity = 0;
}
Assign.c
#include"Assign.h"
#include"Stack.h"// 插入排序
void InsertSort(int* a, int n)
{
for (int i = 1; i < n; i++) // 遍历整个序列,从第二个元素开始(第一个元素默认为有序)
{
int end = i - 1; // 保存当前元素的下标
int tmp = a[i]; // 将当前元素保存到 tmp 中
while (end >= 0) // 从当前元素开始向前遍历
{
if (tmp < a[end]) // 如果 tmp 小于前面的元素,则将前面的元素后移
{
a[end + 1] = a[end]; //挪动覆盖
end--;
}
else // 如果 tmp 大于等于前面的元素,则将 tmp 插入到当前位置
{
break;
}
}
a[end + 1] = tmp; // 将 tmp 插入到当前位置
}
}
// 希尔排序
void ShellSort(int* a, int n)
{
int gap = 3;
for (int j = 0; j < gap; j++) //gap组
{
for (int i = j; i < n - gap; i += gap) //每组进行的循环,间隔为gap
{
int end = i;
int tmp = a[end + gap];
while (end > 0)
{
if (tmp < a[end])
{
a[end + gap] = a[end];
end -= gap;
}
else
{
break;
}
}
a[end + gap] = tmp;
}
}
}
//优化版【多组并排】
//void ShellSort(int* a, int n)
//{
// int gap = 3;
//
// for (int i = 0; i < n - gap; i++ )
// {
// int end = i;
// int tmp = a[end + gap];
// while (end > 0)
// {
// if (tmp < a[end])
// {
// a[end + gap] = a[end];
// end -= gap;
// }
// else
// {
// break;
// }
// }
// a[end + gap] = tmp;
// }
//}// 选择排序
void SelectSort(int* a, int n)
{
int begin = 0;
int end = n - 1;
while (begin > end)
{
int mini = begin, maxi = begin;
for (int i = begin + 1; i <= n; i++) //一次遍历
{
if (a[i] < a[mini])
{
mini = i; //把现在的数标记为mini
}
if (a[i] > a[maxi])
{
maxi = i; //把现在的数标记为maxi
}
}
Swap(&a[begin], &a[mini]);
if (maxi == begin) //这里做出判断是为了防止
{
maxi = mini;
}
Swap(&a[end], &a[maxi]);++begin;
--end;
}}
// 堆排序
void Swap(int* p1, int* p2)
{
int tmp = *p1;
*p1 = *p2;
*p2 = tmp;
}void AdJustDown(int* a, int size, int parent)
{
int child = parent * 2 + 1;while (child < size)
{
// 假设左孩子小,如果解设错了,更新一下if (child + 1 < size && a[child + 1] < a[child])
{
++child;
}if (a[child] < a[parent])
{
Swap(&a[child], &a[parent]);
parent = child;
child = parent * 2 + 1;
}
else
{
break;
}
}
}
void HeapSort(int* a, int n)
{
for (int i = (n -1 - 1) / 2; i > 0; i--)
{
AdJustDown(a, n, i);
}int end = n - 1;
while (end > 0)
{
Swap(&a[0], &a[end]);
AdJustDown(a, end, 0);
--end;
}
}// 冒泡排序
void BubbleSort(int* a, int n)
{
for (int i = 0; i < n - 1; i++)
{
for (int j = 1; j < n - i; j++)
{
if (a[j - 1] > a[j])
{
Swap(&a[j - 1], &a[j]);
}
}
}
}//快排(前序)
void QuickSort(int* a, int left, int right)
{
if (left >= right) // 左右边界相等或左边界大于右边界,直接返回
return;
//int keyi = PartSort3(a,left,right);
//int keyi =PartSort2(a,left,right);
int keyi =PartSort1(a,left,right);QuickSort(a, left, keyi-1);
QuickSort(a, keyi+1, right);
}//三数取中
int GetMid(int* a, int begin, int end)
{
int midi = (begin + end) / 2;
// begin midi end 三个数选中位数
if (a[begin] < a[midi])
{
if (a[midi] < a[end])
return midi;
else if (a[begin] > a[end])
return begin;
else
return end;
}
else // a[begin] > a[midi]
{
if (a[midi] > a[end])
return midi;
else if (a[begin] < a[end])
return begin;
else
return end;
}
}// 快速排序前后指针法
int PartSort3(int* a, int begin, int end)
{
int keyi = begin;
int midi = GetMid(a,begin ,end);
Swap(&a[midi], &a[begin]);
int prev = begin, cur = begin + 1;//前指针找小,后指针找大
while (cur < end+1)
{
if (a[cur] > a[keyi])
{
cur++;
}
else
{
prev++;
Swap(&a[prev], &a[cur]);
cur++;
}
}
Swap(&a[prev], &a[keyi]);
keyi = prev;
return keyi;
}// 快速排序挖坑法
int PartSort2(int* a, int left, int right)
{
int keyi = left;
int midi = GetMid(a, left, right);
Swap(&a[midi], &a[left]);
int hole = left;while (left < right) //相遇就停止
{
while(a[right] >= a[keyi] && left < right )
{
right--;
}
a[hole] = a[right];
hole = right;
while(a[left] <= a[keyi] && left < right)
{
left++;
}
a[hole] = a[left];
hole = left;
}
a[hole] = a[keyi];
return hole;
}// 快速排序hoare版本
int PartSort1(int* a, int left, int right)
{
int keyi = left;
int midi = GetMid(a, left, right);
Swap(&a[midi], &a[left]);while (left < right)
{
while (a[right] >= a[keyi] && left < right)
{
right--;
}
while (a[left] <= a[keyi] && left < right)
{
left++;
}
Swap(&a[left], &a[right]);
}
Swap(&a[keyi], &a[left]);
return keyi;
}// 快速排序 非递归实现
void QuickSortNonR(int* a, int begin, int end)
{
Stack s;
StackInit(&s);
StackPush(&s, begin);
StackPush(&s, end);
if (!StackEmpty(&s))
{
int left = StackTop(&s);
StackPop(&s);
int right = StackTop(&s);
StackPop(&s);int keyi = PartSort3(a, left, right);
if (left < keyi - 1)
{
StackPush(&s, left);
StackPush(&s, keyi - 1);
}
if (keyi + 1 < right)
{
StackPush(&s, keyi + 1);
StackPush(&s, right);
}
}
StackDestroy(&s);
}void QuickSort(int* a, int begin, int end)
{
if (begin >= end)
return;
int keyi = PartSort2(a, begin, end);
QuickSort(a, begin, keyi - 1);
QuickSort(a, keyi + 1, end);}
//归并排序(后序)
//递归
void* _MegreSort(int* a, int begin, int end, int* tmp)
{
if (begin >= end)
return;int mid = (begin + end) / 2;
// [begin, mid][mid+1, end]_MergeSort(a, begin, mid, tmp);
_MergeSort(a, mid + 1, end, tmp);
// [begin, mid][mid+1, end]归并int begin1 = begin, end1 = mid;
int begin2 = mid + 1, end2 = end;
int i = begin;
while (begin1 <= end1 && begin2 <= end2)
{
if (a[begin1] < a[begin2])
{
tmp[i++] = a[begin1++];
}
else
{
tmp[i++] = a[begin2++];
}
}while (begin1 <= end1)
{
tmp[i++] = a[begin1++];
}while (begin2 <= end2)
{
tmp[i++] = a[begin2++];
}memcpy(a + begin, tmp + begin, sizeof(int) * (end - begin + 1));
}void* MergeSort(int* a, int n)
{
int* tmp = (int*)malloc(sizeof(int) * n);
if (tmp == NULL)
{
perror("malloc fail");
return;
}_MergeSort(a, 0, n - 1, tmp);
free(tmp);
}
//非递归
void* MergeSortNonR(int* a, int n)
{
int* tmp = (int*)malloc(sizeof(int)* n);
if (tmp == NULL)
{
perrpr("malloc fail");
return;
}int gap = 1;
while (gap < n)
{for (int i = 0; i <= gap - n + 1; i += gap * 2)
{
int begin1 = i, end1 = i + gap - 1,
begin2 = i + gap, end2 = i + 2 * gap - 1;
// [begin1, end1][begin2, end2] 归并// 边界的处理
if (end1 >= n || begin2 >= n)
{
break;
}if (end2 >= n)
{
end2 = n - 1;
}int j = begin1;
while (begin1 <= end1 && begin2 <= end2)
{
if (a[begin1] < a[begin2])
{
tmp[j++] = a[begin1++];
}
else
{
tmp[j++] = a[begin2++];
}
}while (begin1 <= end1)
{
tmp[j++] = a[begin1++];
}while (begin2 <= end2)
{
tmp[j++] = a[begin2++];
}memcpy(a + i, tmp + i, sizeof(int) * (end2 - i + 1));
}
printf("\n");gap *= 2;
}free(tmp);
}
void CountSort(int* a, int n)
{
int max = a[0], min = a[0];for (int i = 0; i < n; i++)
{
if (a[i] > max)
{
max = a[i];
}
if (a[i] < min)
{
min = a[i];
}
}int range = max - min + 1;
int* count = (int*)calloc(range ,sizeof(int) * n);
if (count == NULL)
{
printf("calloc fail\n");
return;
}for (int j = 0; j < n; j++)
{
count[a[j] - min]++;
}for (int i = 0,j = 0; i < range; i++)
{
while (count[i]--)
{
a[j++] = min + i;
}
}
}
Assign.h
#include<stdio.h>
#include<string.h>
#include<assert.h>// 插入排序
void InsertSort(int* a, int n);// 希尔排序
void ShellSort(int* a, int n);// 选择排序
void SelectSort(int* a, int n);
// 堆排序
void AdJustDown(int* a, int n, int root);
void HeapSort(int* a, int n);// 冒泡排序
void BubbleSort(int* a, int n)// 快速排序递归实现
// 快速排序hoare版本
int PartSort1(int* a, int left, int right)
// 快速排序挖坑法
int PartSort2(int* a, int left, int right);
// 快速排序前后指针法
int PartSort3(int* a, int left, int right);
void QuickSort(int* a, int left, int right);// 快速排序 非递归实现
void QuickSortNonR(int* a, int left, int right);//归并排序
void* _MegreSort(int* a, int begin, int end, int* tmp);
void* MergeSort(int* a, int n);//非递归实现
void* MergeSortNonR(int* a, int n);//计数排序
void CountSort(int* a, int n);