DATA STRUCTURES by Symore Lipschutz

Chapter 2

• Algorithm 2.1 (Finding Max Value)
• Algorithm 2.2 (Bhaskara's Formula)
• Algorithm 2.3 (Finding Max Value)
• Algorithm 2.4 (Finding Specific Item)  
• Programming Problem 2.4 (Prime Number in Sieve Method)
• Solved Problem 2.8(a) (Find First Two Max Value And Location)

Chapter 3 

• Algorithm 3.1 (Deleting Sub-string)
• Algorithm 3.2 (Replace a text From String)
• Algorithm 3.3 (Find Sub-string Location)
• Algorithm 3.4 (Find Sub-string Location (efficient))

Chapter 4

• Algorithm 4.1 (Traversing An Array)
• Algorithm 4.2 (Inserting Into Array) 
• Algorithm 4.3 (Deleting From Array) 
• Algorithm 4.4 (Bubble Sort - Ascending Order) 
• Algorithm 4.5 (Find Item location - Linear search) 
• Algorithm 4.6 (Binary Search) 
• Algorithm 4.7 (Multiplication of Two Matrices)

Chapter 5

• Algorithm 5.1 (Traversing a Linked List) 
• Algorithm 5.2 (Searching  Item in Linked List)
• Algorithm 5.3 (Searching Item in a Sorted Linked List)
• Algorithm 5.4 (Insert Item in First Position in Linked List)
• Algorithm 5.5 (Insert Item in nth Position in Linked List)
• Algorithm 5.7, Procedure 5.6 (Insert Item in a Sorted Linked List)
• Algorithm 5.8 (Deleting Item from nth Position in Linked List)

 Chapter 6

• Procedure 6.1 (Push Item in a Stack.)
• Procedure 6.2 (Pop Item From a Stack.)
• Algorithm 6.8 (Quick Sort (recursive way) )
• Procedure 6.9A (Factorial Calculation (recursive way) )
• Procedure 6.9B (Factorial Calculation (non-recursive way) )
• Procedure 6.10 (Fibonacci Sequence (recursive way) )
• Procedure 6.11 (Towers Of Hanoi (recursive way) )
• Procedure 6.12 (Towers Of Hanoi (non-recursive way) )
• Procedure 6.13 (Insert Item In Queue)
• Procedure 6.14 (Delete Item From Queue)

   ......................................................................................................