m0_61784615的博客

#include<stdio.h>void QuickSort(int*,int,int);int Located(int*,int,int);int main(void){ int i; int a[6]={7,9,3,5,8,4}; QuickSort(a,0,5); for(i=0;i<6;i++) { printf("%d ",a[i]); } return 0;}void QuickSort(int* a,int low,int high){ .

#include<stdio.h>#include<stdlib.h>struct BTNode{ char character; struct BTNode* pLchild; struct BTNode* pRchild;};struct BTNode* CreatBTree(void);void PreTraverseTree(struct BTNode*);//先序遍历 void InTraverseTree(struct BTNode*);//中序遍历 .

#include<stdio.h>void hannuota(int,char,char,char);int main(void){ int i; char ch1='A',ch2='B',ch3='C'; printf("请输入盘子的个数\n"); scanf("%d",&i); hannuota(i,ch1,ch2,ch3); return 0;}void hannuota(int n,char A,char B,char C){ if(1==n) {.

#include<stdio.h>#include<stdlib.h>#include<stdbool.h>struct Node{ int data; struct Node* next;};struct Stack{ struct Node* pTop; struct Node* pBottom;};void init(struct Stack*);void push(struct Stack*,int);bool pop(struct St

#include<stdio.h>#include<stdlib.h>#include<stdbool.h># define N 7struct Queue{ int *pBase; int front; int rear;};void init(struct Queue*);bool is_full(struct Queue*);bool is_empty(struct Queue*);bool en_queue(struct Queue*,i.

#include<stdio.h>int main(void){int x=1,k=1,m=100;int n;scanf("%d",&n);for(x=1;x<=m;x++){if((7x+21kn/52)){printf("%d\n%d",x,k);break;}if(xm&&7x+21k!=n/52){m=m-1;x=1;if(m==1&&7x+21k!=n/52){m=100;k++;}}}re