静态顺序表:一段地址连续的存储单元依次存储数据元素的线性结构
头文件 SeqList.h
#pragma once #include<stdio.h> #include<string.h> #include<assert.h> #include<stdlib.h> #define MAX_SIZE 100 typedef int DataType; typedef struct SeqList { DataType array[MAX_SIZE]; //存储数据的数组 size_t size; //有效数据的个数 }SeqList; typedef struct SeqList SeqLsit; //初始化、删除 void InitSeqList(SeqList *seq); void DestorySeqList(SeqList* seq); //尾部插入、删除 头部插入、删除 void PushBack(SeqList* seq, DataType x); void PopBack(SeqList* seq); void PushFront(SeqList* seq, DataType x); void PopFront(SeqList* seq); //打印顺序表 void PrintSeqList(SeqList* seq); //插入、找到、删除指定位置、删除一个2、删除许多2 void Insert(SeqList* seq, size_t pos, DataType x); void Find(SeqList* seq, DataType x); void Erase(SeqList* seq, size_t pos); void Remove(SeqList* seq, DataType x); void RemoveAll(SeqList* seq, DataType x); //交换两个数 void Swap(int* x, int* y); //冒泡、选择、插入排序 二分查找 void BubbleSort(SeqList* seq); void SelectSort(SeqList* seq); void InsertSort(SeqList* seq); int BinarySearch_One(SeqList* seq, DataType x); int BinarySearch_Two(SeqList* seq, DataType x); int BinarySearch_R(SeqList* seq, DataType x);
#define _CRT_SECURE_NO_WARNINGS 1 #include "SeqList.h" //在顺序表pos位置插入元素 void Insert(SeqList* seq, size_t pos, DataType x) { assert(seq); if (pos >= MAX_SIZE&&pos > seq->size) { printf("输入的位置不合法"); return; } if (seq->size >= MAX_SIZE) { printf("该顺序为满"); } else { for (int i = seq->size; i > pos-1; i--) { seq->array[i] = seq->array[i - 1]; } seq->array[pos - 1] = x; } seq->size++; } //在顺序表中查找某个元素 void Find(SeqList* seq, DataType x) { assert(seq); for (int i = seq->size - 1; i >= 0; i--) { if (seq->array[i] == x) { printf("找到这个元素\n"); return; } } printf("没有找到这个元素"); } //删除顺序表pos位置上的元素 void Erase(SeqList* seq, size_t pos) { assert(seq); assert(pos < seq->size); for (int i = pos - 1; i < seq->size; i++) { seq->array[i] = seq->array[i + 1]; } seq->size--; } //在顺序表中删除x元素 void Remove(SeqList* seq, DataType x) { assert(seq); if (seq->size == 0) { printf("顺序表为空"); } for (int i = seq->size - 1; i >= 0; i--) { if (seq->array[i] == x) { Erase(seq, i+1); } } printf("没有找到这个元素"); } //在顺序表中删除所有为x的元素 void RemoveAll(SeqList* seq, DataType x) { assert(seq); size_t i = 0, j = 0; size_t count = 0; while (i < seq->size) { if (seq->array[i] == x) { ++i; count++; } else { seq->array[j] = seq->array[i]; ++i; ++j; } } seq->size -= count; } //冒泡排序 void BubbleSort(SeqList* seq) { int tmp = 0; int count = 0; for (int i = 0; i < seq->size-1; i++) { int Flag = 0; count++; for (int j = 0; j < seq->size - count-1; j++) { if (seq->array[j]>seq->array[j + 1]) { Swap(&seq->array[j], &seq->array[j + 1]); Flag = 1; } else { } } if (Flag == 0) { return; } } } //选择排序 void SelectSort(SeqList* seq) { assert(seq); // [] size_t begin = 0, end = seq->size-1; size_t minIndex, maxIndex; while (begin < end) { minIndex = maxIndex = begin; for (size_t i = begin; i <= end; ++i) { if (seq->array[i] > seq->array[maxIndex]) { maxIndex = i; } if (seq->array[i] < seq->array[minIndex]) { minIndex = i; } } Swap(&(seq->array[begin]), &(seq->array[minIndex])); if (maxIndex == begin) maxIndex = minIndex; Swap(&(seq->array[end]), &(seq->array[maxIndex])); ++begin; --end; } } //插入排序 void InsertSort(SeqList* seq) { assert(seq); for (int i = 0; i < seq->size - 1; i++) { int end = i; int tmp = seq->array[end + 1]; while (end >= 0 && seq->array[end] > tmp) { seq->array[end + 1] = seq->array[end]; end--; } seq->array[end + 1] = tmp; } } //二分查找 int BinarySearch_One(SeqList* seq, DataType x) { assert(seq); int begin = 0; int end = seq->size-1; while (begin <= end) { //int mid = (begin+end)>>1; int mid = begin+(end-begin)>>1; if (seq->array[mid] < x) { begin = mid+1; } else if (seq->array[mid] > x) { end = mid-1; } else { return mid; } } return -1; } //二分查找 int BinarySearch_Two(SeqList* seq, DataType x) { assert(seq); int begin = 0; int end = seq->size; while (begin < end) { //int mid = (begin+end)>>1; int mid = begin+((end-begin)>>1); if (seq->array[mid] < x) { begin = mid+1; } else if (seq->array[mid] > x) { end = mid; } else { return mid; } } return -1; } //二分查找递归方法 int BinarySearch_R(SeqList* seq, DataType x, int begin, int end) { assert(seq); if (begin > end) return -1; int mid = begin + ((end-begin)>>1); if (seq->array[mid] < x) return BinarySearch_R(seq, x, mid+1, end); else if (seq->array[mid] > x) return BinarySearch_R(seq, x, begin, mid-1); else return mid; } //两个数的交换 void Swap(int* x, int* y) { int tmp = 0; tmp = *x; *x = *y; *y = tmp; } //打印顺序表 void PrintSeqList(SeqList* seq) { assert(seq); for (size_t i = 0; i < seq->size; ++i) { printf("%d ", seq->array[i]); } printf("\n"); } //初始化顺序表 void InitSeqList(SeqList *seq) { memset(seq->array, 0, MAX_SIZE*sizeof(DataType)); seq->size = 0; } //在顺序表的尾部插入元素 void PushBack(SeqList* seq, DataType x) { assert(seq); if (seq->size > MAX_SIZE) { printf("该顺序表已满"); return; } seq->array[seq->size] = x; seq->size++; } //在顺序表的尾部删除元素 void PopBack(SeqList* seq) { assert(seq); if (seq->size == 0) { printf("该顺序表为空"); return; } seq->size--; } //在顺序表头部插入元素 void PushFront(SeqList* seq, DataType x) { assert(seq); if (seq->size > MAX_SIZE) { printf("该顺序表已满"); return; } else { for (int i = seq->size - 1; i >= 0; i--) { seq->array[i + 1] = seq->array[i]; } seq->array[0] = x; } seq->size++; } //在顺序表的头部删除元素 void PopFront(SeqList* seq) { assert(seq); if (seq->size == 0) { printf("该顺序表为空"); return; } else { for (int i = 0; i <= seq->size - 1; i++) { seq->array[i] = seq->array[i + 1]; } } seq->size--; }
#define _CRT_SECURE_NO_WARNINGS 1 #include "SeqList.h" void Test4() { SeqList data; InitSeqList(&data); PushBack(&data, 11); PushBack(&data, 22); PushBack(&data, 33); PushBack(&data, 44); PushBack(&data, 55); PushBack(&data, 66); PushBack(&data, 77); PushBack(&data, 88); PushBack(&data, 99); printf("%d \n", BinarySearch(&data, 1)); } void Test3() { SeqList data; InitSeqList(&data); PushBack(&data, 11); PushBack(&data, 77); PushBack(&data, 22); PushBack(&data, 33); PushBack(&data, 44); PushBack(&data, 66); PushBack(&data, 99); PushBack(&data, 55); PushBack(&data, 88); //PushBack(&data, 10); //PushBack(&data, 9); //PushBack(&data, 8); //PushBack(&data, 7); //PushBack(&data, 6); //PushBack(&data, 5); //PushBack(&data, 4); //PushBack(&data, 3); //PushBack(&data, 2); //PushBack(&data, 1); PrintSeqList(&data); //SelectSort(&data); //BubbleSort(&data); InsertSort(&data); //printf("%d \n", BinarySearch(&data, 66)); PrintSeqList(&data); } void Test2() { SeqList data; InitSeqList(&data); PushBack(&data, 1); PushBack(&data, 2); PushBack(&data, 3); PushBack(&data, 2); PushBack(&data, 5); PushBack(&data, 7); PushBack(&data, 9); PushBack(&data, 2); PushBack(&data, 10); printf("before-> "); PrintSeqList(&data); RemoveAll(&data, 2); printf("after-> "); PrintSeqList(&data); } void Test1() { SeqList data; InitSeqList(&data); PushBack(&data, 1); PushBack(&data, 2); PushBack(&data, 3); PushBack(&data, 2); PushBack(&data, 5); PushBack(&data, 7); PushBack(&data, 9); PushBack(&data, 2); PushBack(&data, 10); //Insert(&data, 2, 2); Find(&data, 2); //Erase(&data, 2); //Remove(&data,2); PrintSeqList(&data); } void Test() { SeqList data; InitSeqList(&data); PushBack(&data, 3); PushBack(&data, 4); PushBack(&data, 5); PushFront(&data, 2); PushFront(&data, 1); PushFront(&data, 0); PrintSeqList(&data); } int main() { // Test(); // Test1(); /* Test2(); */ Test3(); //Test4(); system("pause"); return 0; }