算法第四版练习题答案

算法第4版练习题答案

Algorithms 4th edition exercise answers.

1	FUNDAMENTALS
1.2.13	Transaction.java	transaction data type
1.2.16	Rational.java	rational number data type
1.2.19	Date.java	date data type
1.3.1	FixedCapacityStackOfStrings.java	add isFull() method to stack
1.3.4	Parentheses.java	balanced parentheses
1.3.7	Stack.java	add peek() method to stack
1.3.10	InfixToPostfix.java	infix-to-postfix conversion
1.3.11	EvaluatePostfix.java	evaluate a postfix expression
1.3.14	ResizingArrayQueue.java	resizing array queue
1.3.37	Josephus.java	Josephus problem
1.4.14	FourSum.java	brute-force 4-sum
1.5.7	QuickUnionUF.java	quick union
1.5.7	QuickFindUF.java	quick find
1.5.17	ErdosRenyi.java	Erdos-Renyi simulation
2	SORTING
2.1.1	TraceSelection.java	trace of selection sort
2.1.4	TraceInsertion.java	trace of insertion sort
2.1.9	TraceShell.java	trace of shellsort
2.1.21	Transaction.java	add natural order to Transaction
2.1.22	SortTransactions.java	sort transactions
2.1.23	InsertionX.java	insertion sort with sentinel
2.1.24	InsertionX.java	insertion sort with half exchanges
2.2.2	TraceMerge.java	mergesort trace
2.2.3	TraceMergeBU.java	bottom-up mergesort trace
2.2.9	Merge.java	mergesort without static array
2.2.11	MergeX.java	improved mergesort
2.2.19	Inversions.java	count number of inversions
2.2.20	Merge.java	index sort
2.3.1	TracePartition.java	partition trace
2.3.2	TraceQuick.java	quicksort trace
2.3.5	Sort2distinct.java	sort array with 2 distinct keys
2.3.12	TraceQuick3way.java	3-way quicksort trace
2.3.16	QuickBest.java	best-case for quicksort
2.3.22	QuickX.java	Bentley-McIlroy 3-way quicksort
2.4.3	OrderedArrayMaxPQ.java	ordered array priority queue
2.4.3	UnorderedArrayMaxPQ.java	unordered array priority queue
2.4.15	MaxPQ.java	check if an array is heap-ordered
2.4.25	CubeSum.java	find a^3 + b^3 = c^3 + d^3
2.4.33	IndexMaxPQ.java	index priority queue
2.5.8	Frequency.java	count word frequencies
2.5.12	SPT.java	shortest processing time first rule
2.5.13	LPT.java	longest processing time first rule
2.5.14	Domain.java	sort by reverse domain name
2.5.16	California.java	2003 California gubernatorial election order
2.5.19	KendallTau.java	Kendall Tau distance
2.5.24	StableMinPQ.java	stable priority queue
2.5.25	Point2D.java	point comparators
2.5.27	Insertion.java	index sort
2.5.28	FileSorter.java	sort files by name
3	SEARCHING
3.1.1	GPA.java	compute GPA
3.1.2	ArrayST.java	unordered-array symbol table
3.1.5	SequentialSearchST.java	add size(), delete(), and keys()
3.1.16	BinarySearchST.java	add delete()
3.1.17	BinarySearchST.java	add floor()
3.1.29	TestBinarySearchST.java	test client
3.1.30	BinarySearchST.java	check internal invariants
3.2.6	BST.java	add height() method
3.2.10	TestBST.java	test client
3.2.13	NonrecursiveBST.java	nonrecursive BST
3.2.24	PerfectBalance.java	perfectly balanced BST
3.2.32	BST.java	order check
3.2.33	BST.java	rank/select check
4	GRAPHS
4.1.3	Graph.java	add copy constructor
4.1.13	BreadthFirstPaths.java	add distTo() method
4.1.23	BaconHistogram.java	histogram of Bacon numbers
4.1.26	DegreesOfSeparationDFS.java	degrees of separation with DFS
4.1.27	MemoryOfGraph.java	memory of Graph data type
4.1.36	Bridge.java	find bridges
4.2.3	Digraph.java	add copy constructor
4.2.21	MemoryOfDigraph.java	memory of Digraph data type
4.2.23	DirectedEulerianCycle.java	directed Eulerian cycle
4.2.31	TopologicalQueue.java	queue-based topologial sort
4.2.39	WebCrawler.java	web crawler
4.3.9	EdgeWeightedGraph.java	edge-weighted graph constructor
4.3.11	MemoryOfEdgeWeightedGraph.java	memory of edge-weighted graph
4.3.17	EdgeWeightedGraph.java	add toString() to EdgeWeightedGraph
4.3.21	PrimMST.java	add edges() to PrimMST
4.3.22	PrimMST.java	minimum spanning forrest
4.3.22	KruskalMST.java	minimum spanning forrest
4.3.33	KruskalMST.java	MST certification
4.3.43	BoruvkaMST.java	Boruvka's algorithm
4.4.2	EdgeWeightedDigraph.java	add toString() method
4.4.11	MemoryOfEdgeWeightedDigraph.java	memory of EdgeWeightedDigraph data type
4.4.12	Topological.java	topological sort in edge-weighted digraphs
4.4.12	EdgeWeightedDirectedCycle.java	directed cycle in edge-weighted digraphs
4.4.28	AcyclicLP.java	longest paths in DAGs
4.4.35	LazyDijkstraSP.java	lazy implementation of Dijkstra

算法第四版练习题答案相关推荐

【算法】算法第四版练习题的解法
https://github.com/shalliestera/Algorithms-4th-Edition-Exercise-solutions 自己尝试的解法以及解答过程. 转载于:https:/ ...
算法第四版课后习题答案西安电子科技大学计算机学院算法课
来源于西电计算机15级学长学姐,算法第四版课后习题答案西安电子科技大学计算机学院算法课. 再推荐一个好的看答案的地方,每一题都有,只是还没有更新完成. 地址:https://alg4.ike ...
算法第四版扔鸡蛋问题
本题来源于算法第四版1.4.25.1.4.26. 同时好像记得看过的腾讯面经里也问到过类似题目,因此觉得有必要仔细做一下. 题目如下: 一幢 100 层的大楼,给你两枚鸡蛋.假设,在第 n 层扔下鸡蛋 ...
算法第四版- 3.1
算法第四版- 3.1 文章目录 **算法第四版- 3.1** 1.二分查找 1)LC704二分查找 2)LC744二分查找 3)LC33搜索旋转排序数组 4)搜索旋转数组进阶 2.跳表 1.二分查找 ...
1.1.10 从二分查找BinarySearch开启算法学习之路---《java算法第四版》
文章目录 0.前言 1.功能 2.示例有两个名单tinyW.txt和tinyT.txt,将tinyT.txt名单中不在tinyW.txt的数据打印出来 ① 实现原理 ② 实现代码 ③ 性能分析 0. ...
0202插入删除-算法第四版红黑树-红黑树-数据结构和算法(Java)
文章目录 4 插入 4.1 序 4.2 向单个2-结点插入新键 4.3 向树底部的2-结点插入新键 4.4 向一棵双键树(3-结点)中插入新键 4.5 颜色调整 4.6 根结点总是黑色 4.7 向树底 ...
《算法第四版》官方jar包中In的readStrings()方法不建议使用的解决办法
起因:在学习<算法第四版>过程中总是遇到一些算法之外的小问题,比如本书中所需要下载的库.今天在学习排序那一节时,发现排序框架main()方法中的In的readStrings()方法不能使用 ...
WordNet 普林斯顿算法第四版
普林斯顿算法第四版本文的代码以及之前的作业代码可通过一下github链接获得 https://github.com/Changjing-Liu/algorithm_lab 文章目录普林斯顿算法 ...
Algorithms, 4th Edition（算法-第四版）源码使用系统配置
关于-Algorithms, 4th Edition (算法-第四版)源代码在本地机器的运行配置. 其实关于这个教程的使用已经在 Java Algorithms and Clients 页面中写出,并 ...
BoggleSolver 普林斯顿算法第四版
BoggleSolver 普林斯顿算法第四版文章目录 BoggleSolver 普林斯顿算法第四版一. 引言 1. Boggle 2. 计分 3. Qu特殊情况 4. 任务要求二.分析 1. ...

算法第四版练习题答案

算法第四版练习题答案相关推荐

最新文章

热门文章