best book for data structures in java

() method in the Bubblesort.java program (listing 3.1) with the Oddevensort () method . Make sure it runs in a sort of different amount of data, and that you need to figure out the number of two scans. Parity Ordering is actually useful in multiprocessor environments where the processor can process each odd pair at the same time, and then handle even pairs at the same time. Because the odd pairs are independent of each other, each pair can be compar

Recently listening to colleagues said that the use of Sparsearray instead of HashMap can improve performance, so the edge of the two classes of data structure for a simple analysis.Data structure of HashMapHashMap is a combination of arrays and linked lists (in the data structure called "chain-Table hashing"), as shown in:Photo Source: Java's HashMap and HashtableData structure of SparsearraySparsearray ref

Method Public BooleanDeleteLongvalue) { intj =find (value); if(j==Nelems) { return false; } Else { for(intK=j; k) {A[k]= A[k+1]; } nelems--; return true; } } //Binary Method Search Public intFindLongSearchkey) { intlowerbound = 0; intUpperbound = nElems-1; intCurin; while(true) {Curin= (lowerbound + upperbound)/2; if(a[curin]==Searchkey) { returnCurin;//found it } Else if

)? {???????? This.ddata?=?ddata;???????? This.idata?=?idata,????}???? Public?void?displaylink ()? {???????? System.out.println ("{"? +?idata?+? ",?"?) +?ddata?+ "}");????}}Simple test Cases:Package?com.xingej.algorithm.datastructure.linkedlist.singlelinkedlist;import?org.junit.test;/**?*? single-linked list test? *[email protected]?erjun?2017 December 8? Morning 9:00:54?*/public?class? Linklisttest? {[email protected]???? Public?void?test ()? {???????? Linklist?list?=?new? Linklist ();???????? ?

=currentlink.next;} System.out.println (""); System.out.print ("Linklist.displaylist () Finish");}}public class Linklistapp {public static void main (string[] args) {linklist thelinklist =new linklist (); Thelinklist.insertlink (9, 999, 999.999); Thelinklist.displaylist (); Thelinklist.insertfirst (22, 22.22); Thelinklist.insertfirst (33.33), Thelinklist.insertfirst (44.44), Thelinklist.insertfirst (55, 55.55); Thelinklist.displaylist (); Thelinklist.insertlink (2, 333, 333.333); Thelinklist.di

); Linkedlist.removefirst (); Linkedlist.removelast (); //determine if the linked list is emptySystem.out.println (Linkedlist.isempty ());} HashMap Non-synchronous Public Static voidhashmaptest () {HashMapNewHashmap(); //adding elements to the hash tableHashmap.put ("TP", 123); Hashmap.put ("ZP", 567); System.out.println (HASHMAP); //facilitates a hash table with iterators for(IteratorHashmap.entryset (). iterator (); Iterator.hasnext ();) {EntryIterator.next (); Syst

));}} //Look at cardsLookpoker ("Wind Qing", Fengqingyang);Lookpoker ("Brigitte", Linqingxia);Lookpoker ("Elina", Liuyi); lookpoker ("hole cards", Dipai);}public static void Lookpoker (String name, arraylistSystem.out.print (name + "The card is:");for (String S:array) {System.out.print (S + "");}System.out.println ();}} Test multiple timesOutput: The wind of the card is: Xiao Wang ♦8♥10♦5♣q♥4♣7♣8♠9♦a♠4♥7♠2♦6♠7♥8♣9Brigitte's cards are: ♦q♥5♥9♠a♠6♣3♠q♦7♦10♠k♦k♣k♥3♠10♠8♥6♠5Elina's cards are: ♥2♠3♥

(Array.get (x)); } NBSP;NBSP;} Look at the cardsLookpoker ("Wind Qing", Fengqingyang);Lookpoker ("Brigitte", Linqingxia);Lookpoker ("Elina", Liuyi); lookpoker ("hole cards", Dipai);}public static void Lookpoker (String name, arraylistSystem.out.print (name + "The card is:");for (String S:array) {System.out.print (S + "");}System.out.println ();}} Test multiple timesOutput: The wind is the card is: Xiao Wang 8? 10? 5? Q. 4? 7? 8? 9? A 4? 7 2? 6? 7? 8? 9Brigitte's cards are:? Q. 5? 9? A? 6? 3?

the left to find an element that is larger than the base element, stop, the two elements are exchanged until two pointers meet, the end of the cycle * pointer point to the The position is where the datum element should be located in the collection * eg * {8,-2, 3, 9, 0, 1, 7, 6} * Benchmark * First bm=8 * end = Lengt h-1 = 7 * start=0 * End--, We found 6:8 small, end pointer stopped, current index is j=7 * start++, until element 9 stops, current index i=3 * Exchange the elements corresp

: Network Disk DownloadFirst, the content of the book is a foreign data structure and algorithm analysis of the classic textbook, using the excellent Java programming language as the implementation tool to discuss the data structure (the method of organizing a large number of data