weixin_42543048的博客

#include <stdio.h> void HeapAdjust(int a[], int k, int len) { a[0] = a[k]; for (int i = 2 * k;i <= len;i *= 2) { if (i < len && a[i] < a[i + 1]) { i++; } if (a[0] >= a[i]) { break; } else { a[k] = a[i]; k

#include <stdio.h> int Partition(int a[], int low, int high) { int pivot = a[low]; while (low < high) { while (low < high && a[high] >= pivot) high--; a[low] = a[high]; while (low < high && a[low] <= pivot) low

#include <stdio.h> int main() { int a[10]; int n; printf("请输入要排序数的个数：\n"); scanf("%d", &n); printf("请输入要排序的数：\n"); for (int i = 0;i < n;i++) { scanf("%d", &a[i]); } for (int i = 0;i < n;i++) { for (int j = 0;j < n - 1;j+

#include <stdio.h> int main() { int a[10]; int n; printf("请输入要排序数的个数：\n"); scanf("%d", &n); printf("请输入要排序的数：\n"); for (int i = 0;i < n;i++) { scanf("%d", &a[i]); } for (int i = 1;i < n;i++) { int low = 0, high = i - 1; i

#include <stdio.h> #include <stdlib.h> #include <iostream> using namespace std; typedef struct LinkNode{ char data; struct LinkNode * next; }LinkNode,*LiStack; int InitStack(LiStack &L)//初始化栈 { L = NULL; return 1; } int Push(Li

#include <stdio.h> int main() { int a[10]; int n; printf("请输入要排序数的个数：\n"); scanf("%d", &n); printf("请输入要排序的数：\n"); for (int i = 0;i < n ;i++) { scanf("%d",&a[i]); } for (int i = 1;i < n;i++) { while(a[i] < a[i - 1] &