松猪的专栏

#include <stdio.h>#include <stdlib.h>#include <time.h>#define ARRAY_SIZE 50int ElementSwitch(int a[], int first, int second){ int tmp; tmp = a[first]; a[first] = a[second]; a[second] = tmp; return 0;}int Shuffle(int a[].

#include <stdio.h>#include "tinycthread.h"int SayHello(char *name){ printf("Run in new thread [%#x]: Hello, %s\n", thrd_current(), name); return 0;}int main(void){ thrd_t new_thread; int result = thrd_create(&new_thread, SayHello, .

#include <stdio.h>unsigned Factorial(unsigned n){ if(n == 0){ return 1; } else{ return n * Factorial(n - 1); }}int main(void){ printf("3! %d\n", Factorial(3)); printf("5! %d\n", Factorial(5)); printf("8! %d\n", Factorial(8)).

#include <stdio.h>#include <stdarg.h>void HandleVarargs(int arg_count, ...){ //定义 va_list用于获取变长参数 va_list args; //开始便利 va_start(args, arg_count); for (int i = 0; i < arg_count; ++i) { //取出对应参数 int arg = va_arg(args, int).

点击(此处)折叠或打开 #include stdio.h> void myswap(int, int); void ptr_myswap(int*, int*); int main(){

浮点型参数输入到浮点型返回值的函数中，返回正确的值，20.25 点击(此处)折叠或打开 #include stdio.h> /* declaration */ float square(float);

点击(此处)折叠或打开 #includestdio.h> /* function prototype */ int square(int); /* main */ int main(){

点击(此处)折叠或打开 /* The base salary is $200 per-week, bonus is sale * 9%, input the sale, output actual salary */ #includestdio.h> int main(){

点击(此处)折叠或打开 #includestdio.h> int main(){     int int_number;     printf("please enter a integer: ");     scanf("%

点击(此处)折叠或打开 #includestdio.h> int main(){     int i;     printf("number\tsquare\tcube\t\n");

从这篇博文学到的，由衷感谢panda点击打开链接/*名称：初始化链表(1)（直接改变主调函数中的指针head）功能：制造一个头节点接收：指向节点的指针地址 &head返回：int*/int ref_initLink(struct node **L){ //L为指向head（指向节点的指针）的指针，用L接收head的地址 //L接收到head的地址（&head）后，用malloc

点击(此处)折叠或打开 #include stdio.h> #include math.h> int main(){     /* declaration */     int x;

点击(此处)折叠或打开 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * @file * @author Sam Liu * @rem

点击(此处)折叠或打开 #include stdio.h> #include stdlib.h> /* main */ int main(void){     int x;

/* C How to program 2.3 */ /* Input:2 integers */ /* Output:add the two integer */ #includestdio.h> int main() {     /* Decla

#includestdio.h> int main() {     int x;     int y;     int z;     int result;     int intInput;     p

点击(此处)折叠或打开 #includestdio.h> void fun_a(void);    /* function prototype */ void fun_b(void);    /* function prototype */

点击(此处)折叠或打开 #include stdio.h> int main(){     /* declaration the variable */     int i_end;

点击(此处)折叠或打开 #include stdio.h> #include stdlib.h> /* declaration and initialize globe variable */ int FREQUENCY1 =

点击(此处)折叠或打开 /* Calculation two integers + * - / % */ /* Input: two integers */ /* Output: the sam is: the differ

/***name: create a seqlistreceive: seqlist addressreturn: int***/int creat(Seqlist* L){ int len; L->length = 0; printf("Enter the length of the seqlist:"); scanf("%d", &len); if (len <= 100)

点击(此处)折叠或打开 #include stdio.h> #include stdlib.h> #include time.h> int main(){

点击(此处)折叠或打开 #include stdio.h> /* declaration */ int myadd(int , int); /* 等价于 int myadd(int a, int b); */ /* main

#includestdio.h> int main(){   int int_score;    printf("Please Enter a score:");    scanf("%d", &int_score);    printf("%s", int_score >=

#include //define the size of array#define MAXSIZE 100//define new data type: stackstruct stack{ int data[MAXSIZE]; int top;};//defint var seqStacktypedef struct stack seqStack;//crea

点击(此处)折叠或打开 #includestdio.h> int main(){     int int_score;     printf("%s", "Please enter a score: ");     scanf

/*名称：头插法插入链表节点功能：在链表头节点后插入一个链表节点接收：链表头节点head, 插入节点的int型数据返回：int*/int insertLink_head(struct node* L, int data){ //定义一个指向链表节点的指针 struct node *nodePtr; //当链表为空链表时 if ((L->next) == NULL){ //给

/*名称：菜单功能：建立一个菜单用来控制链表接收：void返回：int*/int menulink(void){ struct node *head = NULL; int data = 0, deldata = 0; int choose; printf("************* LINK LIST MENU *************\n"); printf("\t1

#include #define FIBONSIZE 20int main(){ int a = 0, b = 1, c, fibon[FIBONSIZE]; for (int i = 0; i < FIBONSIZE; i++){ c = a + b; fibon[i] = c; a = b; b = c; } for (int i = 0; i < FIBONS

#include #include #define STACKMAXSIZE 10typedef struct seqstack{ int data[STACKMAXSIZE]; int top;}SeqStack;int initSeqStack(SeqStack*);int destroySeqStack(SeqStack*);int clearS

#include int mycube(int);using namespace std;int main(){ int side; cout << "enter the cube side: " << endl; cin >> side; cout << "the volume of the cube is: " << mycube(side) <<

#include "seqstack.h"int initSeqStack(SeqStack* S){ S->top = 0; return 0;}int clearSeqStack(SeqStack* S){ for (int i=0; itop; i++) S->data[i] = 0; S->top = 0; return 0

#include "seqstack.h"int main(){ SeqStack stack; initSeqStack(&stack); printf("%d\n", isEmptySeqStack(stack)); PushSeqStack(&stack, 111); PushSeqStack(&stack,

#include #include using namespace std;int square(int);double square(double);int main(){ cout << square(8) << endl; cout << square(9.3) << endl; return 0;}int square(int edge){

#include #include using namespace std;int square(int);double square(double);int main(){ cout << square(8) << endl; cout << square(9.3) << endl; return 0;}int square(int edge){

#include using namespace std;template T volume(T side1, T side2, T side3){ return side1 * side2 * side3;}int main(){ cout << volume(1, 2, 3) << endl; cout << volume(1.2, 2.0, 3.3) << endl;

#include using namespace std;class Time{public: //构造函数 Time(); //设置时间函数 void setTime(int, int, int); //24小时制显示时间 void showTime24(); //12小时制显示时间 void showTime12();private: int hour; int

#include #include //define a link node structtypedef struct linklistnode{ int data; struct linklistnode *next;}linklist, *linklistPtr;//declaration create_linklistint create_linklist(l

#include "linklist.h"int main(){ linklistPtr head; create_linklist(&head); printf("%d\n", head->data); insert_linklist(&head); traversal_linklist(head); del_linklis

#include "seqlist.h"//1 创建一个顺序表int create_SqList(SqListPtr L){ for (int i = 0; i < LISTMAXSIZE; i++) L->data[i] = 0; L->length = 0; return 0;}//2 判断顺序表是否为空int isEmpty_SqList(SqList L){ re