![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法导论
学海无涯0216
这个作者很懒,什么都没留下…
展开
-
算法导论之插入算法java实现
import java.util.Arrays;public class Main { public static void main(String[] args) { //插入算法 Integer[] A = {1,3,5,7,2,4,6,8,10,9}; for(int j=1;j<A.length;j++){ ...原创 2018-05-12 16:23:31 · 807 阅读 · 3 评论 -
算法导论之红黑树算法java实现
/** * Java 语言: 红黑树 */public class RBTree<T extends Comparable<T>> { private RBTNode<T> mRoot; // 根结点 private static final boolean RED = false; private static final boo...转载 2018-05-14 14:18:29 · 168 阅读 · 0 评论 -
算法导论:插入排序算法之python实现
A = [99, 38, 65, 97, 76, 13, 27, 49]# 排序过程# A = [38, 99, 65, 97, 76, 13, 27, 49]# A = [38, 65, 99, 97, 76, 13, 27, 49]# A = [38, 65, 76, 97, 99, 13, 27, 49]# A = [13, 38, 65, 76, 97, 99, 27, 49]...原创 2018-06-27 11:27:14 · 170 阅读 · 0 评论 -
算法导论:两个n位的二进制整数相加问题之python实现
A = [1, 1, 0, 0, 1, 1, 0, 1]B = [1, 1, 1, 0, 1, 0, 1, 1]def sumbinary(A, B): A.reverse() B.reverse() C = [] temp = 0 length = len(A) for i in range(0, length): C.ap...原创 2018-06-27 14:37:06 · 1084 阅读 · 0 评论 -
算法导论:选择排序算法之python实现
A = [99, 38, 65, 97, 76, 13, 27, 49]# 排序过程# A = [13, 38, 65, 97, 76, 99, 27, 49]# A = [13, 27, 65, 97, 76, 99, 38, 49]# A = [13, 27, 38, 97, 76, 99, 65, 49]# A = [13, 27, 38, 49, 76, 99, 65, 97...原创 2018-06-27 15:14:30 · 151 阅读 · 0 评论 -
算法导论:归并排序算法之python实现
A = [99, 38, 65, 97, 76, 13, 27, 49]# 排序步骤# A = [99, 38, 65, 97][76, 13, 27, 49]# A = [99, 38][65, 97][76, 13][27, 49]# A = [38, 99][65, 97][13, 76][27, 49]# A = [38, 65, 97, 99][13, 27, 49, 76]...原创 2018-06-27 15:53:37 · 436 阅读 · 0 评论 -
算法导论:双重递归过程分析python描述
# 双重递归过程分析# 1 8# 1 4# 1 2# 1 1# 2 2# 3 4# 3 3# 4 4# 5 8# 5 6# 5 5# 6 6# 7 8...原创 2018-06-27 18:19:34 · 585 阅读 · 0 评论 -
算法导论:2.1插入排序练习题 python描述
# 2.1插入排序练习题# 2.1-1A = [31, 41, 59, 26, 41, 58]A = [31, 41, 59, 26, 41, 58]A = [31, 41, 59, 26, 41, 58]A = [26, 31, 41, 59, 41, 58]A = [26, 31, 41, 41, 59, 58]A = [26, 31, 41, 41, 58, 59]# 2....原创 2018-06-28 11:55:50 · 464 阅读 · 0 评论 -
算法导论:2.2分析算法练习题 python描述
# 2.2分析算法练习题 python描述# 2.2-1# Θ(n^3)# 2.2-2A = [99, 38, 65, 97, 76, 13, 27, 49]# 排序过程# A = [13, 38, 65, 97, 76, 99, 27, 49]# A = [13, 27, 65, 97, 76, 99, 38, 49]# A = [13, 27, 38, 97, 76, 99...原创 2018-06-28 14:07:04 · 333 阅读 · 0 评论