freiheit_zz的博客

以下是汉诺塔核心代码// n : 汉诺塔层数// from : 从哪个柱子// buffer : 中转站// to : 移动到哪里void move (int n, char from, char buffer, char to){ if (n == 1) { cout << "[" << step << "] " << "Move" << " from " << from << ...

冒泡排序void BubbleSorted(int *nums, int numsSize){ int temp; int i, j; for(i = 0; i < numsSize; i++){ for(j = i + 1; j < numsSize; j++){ if(nums[i] > nums[j]){ temp = nums[i]; nums[i

使用C语言计算圆周率的大小#include <stdio.h>#include <math.h>#define COUNT 100000000 //计算次数int main(void){ double value=0; double a=1; unsigned char i=0; while(a/2<COUNT) { if(i%2=