000			00951nam a22001697a 4500
008			240209b |||||||| |||| 00| 0 eng d
020			_a9780321573513
082			_a005.1 _bSED
100			_aSedgewick, Robert _93278
245			_aAlgorithms
250			_a4th ed
260			_bPearson Education, Inc. _c2011 _aBoston
300			_a955p
500			_a1. Fundamentals Basic Programming Model Data Abstraction Bags, Queues, and Stacks Analysis of Algorithms Case Study: Union Find 2. Sorting Elementary Sorts Mergesort Quicksort Priority Queues Applications 3. Searching Symbol Tables Binary Search Trees Balanced Search Trees Hash Tables Applications 4. Graphs Undirected Graphs Directed Graphs Minimum Spanning Trees Shortest Paths 5. Strings String Sorts Tries Substring Search Regular Expressions Data Compression
600			_aComputer Engineering
942			_2ddc _cLB _k005.1 _mSED
999			_c148335 _d148335