Data structure various sort summary

#include <iostream> #include <algorithm> #define MAXSIZE 10000#define OK 1typedef int Keytype;typedef Char Infotype;typedef int status;using namespace std;typedef struct{KeyType key; InfoType Otherinfo;} Redtype;typedef struct{redtype r[maxsize+1]; int length;} SqList; Status initlist_sq (sqlist &l,int a[],int N) {l.length=n; for (int i=1;i<=n;i++) l.r[i].key=a[i]; return OK;} void Showsqlist (SqList L) {for (int i=1;i<=l.length;i++) cout<<l.r[i].key<< ""; Cout<<endl;} ----------------Quick Sort-------------int Partition (sqlist &l, int low,int high) {int pivotkey=l.r[low]. Key L.r[0]=l.r[low];  while (Low
Hill sort, quick sort, heap sort, merge sort, base sort
Data structure various sort summary