临江仙985-CSDN博客

原创 python实验—蟒蛇绘制程序

import turtledef drawSnake (rad, angle, len, neckrad) : for i in range (len) : turtle.circle (rad, angle) turtle.circle (-rad, angle) turtle.circle (rad, angle/2) turtle.fd(rad) turtle.circle (neckrad+1,180) turtle.fd

2021-01-31 20:08:52 577

原创 python实验—温度转换程序

for i in range(10): val = input("请输入带温度表示符号的温度值(例如: 32C): ") if val[-1] in ['C','c']: f = 1.8 * eval(val[0:-1]) + 32 print("转换后的温度为: %.2fF"%f) elif val[-1] in ['F','f']: c = (eval(val[0:-1]) - 32) / 1.8 print("转换后的温度为: %.2fC"%

2021-01-31 20:04:25 847

原创数据结构实验—C语言实验—堆排序

#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

2020-07-15 14:31:12 239

原创数据结构实验—C语言实验—快速排序

#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

2020-07-15 10:05:39 477

原创数据结构实验—C语言实验—冒泡排序

#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+

2020-07-14 13:58:38 786

原创数据结构实验—C语言实验—折半插入排序

#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

2020-07-14 13:06:54 307

原创数据结构实验—C语言实验—直接插入排序

#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] &

2020-07-14 11:52:33 504 1

原创数据结构实验-括号匹配的检验-链栈实现

#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

2020-06-30 15:30:42 856 1

weixin_42543048的博客