算法
文章平均质量分 76
tywangh
这个作者很懒,什么都没留下…
展开
-
计算两个非负整数的最大公约数(欧几里得算法)
来自《算法(第四版)》--【美】 Robert Sedgewick,Kevin Wayne 译:谢陆云自然语言描述:计算两个非负整数p和q得最大公约数:若q是0,则最大公约数为p。否则,将p除以q得到余数r,p和q的最大公约数即为q和r的最大公约数。重复上面的循环,直到当余数为0时,此时可得出最大公约数为余数为0的被除数。java语言描述: public原创 2017-06-20 23:57:22 · 1487 阅读 · 0 评论 -
二分搜索法
二分搜索法:public class BinarySearch { public static int rank(int key, int[] numList){ int lo = 0; int hi = numList.length-1; while(lo <= hi){ int mid = lo +(hi-lo)/2; if(key < numList[mid]){原创 2017-06-28 00:41:24 · 292 阅读 · 0 评论 -
冒泡排序
#include<cstdio>int main(){ int a[10]; printf("请输入十个数:\n"); for(int i = 0; i < 10; i++){ scanf("%d",a+i); } for(int j = 1; j < 10; j++){ for(int k = 0; k < 10 - j; k++){ i...原创 2018-07-21 18:45:24 · 134 阅读 · 0 评论 -
选择排序(C/C++)
#include<cstdio>int main(){ int a[10]; printf("请输入十个数:\n"); for(int n = 0; n < 10; n++){ scanf("%d", a + n); } for(int i = 0; i < 9; i++){ int k = i; for(int j = i + 1; j< ...原创 2018-07-21 19:02:44 · 142 阅读 · 0 评论 -
插入排序
#include<cstdio>int main(){ int a[10]; printf("请输入十个数:\n"); for(int n = 0; n < 10; n++){ scanf("%d", a + n); } for(int i = 1; i < 10; i++){ int j = i; int temp = a[i]; whil...原创 2018-07-21 19:42:18 · 190 阅读 · 0 评论 -
PAT A1074 Reversing Linked List(25 分)
Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4,...原创 2018-08-26 14:02:48 · 382 阅读 · 0 评论 -
PAT A1043 Is It a Binary Search Tree(25 分)
1043 Is It a Binary Search Tree(25 分)A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with ke...原创 2018-09-07 21:36:00 · 320 阅读 · 1 评论