Cache algorithms and data structures
Chapter 1 Basic and concept of Cache algorithm and data structure
Chapter 2 Cache algorithm and data structure array principle
Chapter 3 Cache algorithm and data structure linked list principle
Chapter 4 Cache algorithm and data structure stack principle
Chapter 5 Cache Algorithm and data Structure queue principle
Chapter 6 Cache Algorithm and Data Structure Circular queue
Chapter 7 Cache Algorithm and Data Structure Double-endian queue
Chapter 8 Cache Algorithm and Data Structure hash table
Chapter 9 Cache Algorithm and data Structure binary tree
Chapter 10 Cache Algorithm and Data Structure Binary heap
Chapter 11 Cache Algorithms and Data Structures Priority queues
Chapter 12 Cache Algorithm and Data Structure bubbling Sort
Chapter 13 Cache algorithm and Data structure cocktail sorting
Chapter 14 Cache Algorithm and Data structure Quicksort
Chapter 15 Cache Algorithm and Heap sorting of data Structures
Chapter 16 Cache Algorithm and Data structure counting sort
Chapter 17 Cache Algorithm and Data Structure Hill sort
Chapter 18 Cache Algorithm and Data structure selection sort
Chapter 19 Cache Algorithm and Data structure insertion sort
Chapter 20 Cache Algorithm and Data structure Merge Sort
Chapter 21 Cache Algorithm and Cardinality Sorting of data Structures
Chapter 22 Cache Algorithm and Bucket Sorting of data Structures
Chapter 23 Cache Algorithm and Binary Search of data Structure
Chapter 24 Cache Algorithm and Data Structure Fibonacci Search
Chapter 25 Cache algorithm and Data structure interpolation search
preface
- After a month of serialized “Cache algorithm and Data Structure” basic series finally serialized. Mainly explained the data structure, sorting algorithm, search algorithm. This “Cache algorithm and data structure” based on the application of the most common JAVA development language, and JAVA array, heap, stack, MAP, queue, linked list and other data structures, convenient Cache to achieve some complex logical structure. Due to limited personal ability, there are some more advanced algorithms and data structures have not been implemented, such as AVL tree, 2-3 tree, 2-3-4 tree, B tree, Tire tree, greedy algorithm, dial-and-conquer algorithm, dynamic programming, backtracking enumeration algorithm, blocking queue, concurrent queue, Fibonacci heap, etc. The analysis of some questions will inevitably be flawed. The solution in the example is not perfect, the author has left some thoughts in each chapter, interested friends can think about the completion of the message to discuss together. Also hope to find other problems of friends to timely feedback to the author.
- Because the author is the basic version, so it is not too difficult, we can practice the code again, I believe that it will be helpful to personal programming ability and basic ideas of programmers.
trailer
- The next installment will be serialized in one month, Cache Command, Cache command is the most commonly used, most daily contact. However, I believe that most people only know one of the commands and don’t know the other. Each command has some unique and useful uses. According to the 28 principles, this “Cache Commands” will give a detailed overview and explanation of all the commands.
Communication group
- QQ group number: 410039091
- Author QQ: 454115408
- Public number: straight male technology science
