售 价：¥
9.8
温馨提示：数字商品不支持退换货，不提供源文件，不支持导出打印
为你推荐
To the Reader
Introduction to sorting algorithms
Total order
Significance of sorting – Binary search
Applications of sorting
Applications of sorting – the 2-SUM and 3-SUM problems
Compares of items in sorting
Item[] instead of Comparable[]
Defining the data structure
Binary search parameterized implementation
Thinking in terms of compares and exchanges of items – the less() and exchange() helper methods
Selection sort
Selection sort invariants and Java implementation
Selection sort – required number of compares and exchanges of items
Insertion sort
Insertion sort invariants and Java implementation
Insertion sort – required number of compares and exchanges of items
Insertion sort – required number of compares and exchanges of items
Insertion sort with binary search
Shellsort
Shellsort properties and Java implementation
Mergesort
Merging two sorted subarrays
Merging two sorted subarrays – required number of compares of items
Top-down mergesort
Top-down mergesort – properties and practical improvements
Bottom-up mergesort
Counting inversions in the array with mergesort
Shuffling
Quicksort
Check yourself
Check yourself – Answers
买过这本书的人还买过
读了这本书的人还在读
同类图书排行榜
购物车
个人中心
