Searching and Sorting

Searching and Sorting

Lecture #15: Basic Algorithms for Searching and Sorting

• Lecture Notes
• Questions for Review
• Additional Reading: Tail Calls

Tutorial Exercise #15: More about Binary Search

• Problems To Be Solved

Lecture #16: Merge Sort

• Lecture Notes
• Questions for Review

Tutorial Exercise #16: Merge Sort

• Problems To Be Solved

Lecture #17: Binary Heaps

• Lecture Notes
• Questions for Review
  
  
• Java Code: Unbounded Heaps
  
  
  • Interface for a MinHeap — MinHeap.java: [ Source ] [ Documentation ]
  • Intervace for a MaxHeap — MaxHeap.java: [ Source ] [ Documentation ]
    
    
• Java Code: Bounded Heaps
  
  
  • Exception to be Thrown when Heap is Full — HeapFullException.java: [ Source ] [ Documentation ]
  • Interface for a Bounded MinHeap — BoundedMinHeap.java: [ Source ] [ Documentation ]
  • Interface for a Bounded MaxHeap — BoundedMaxHeap.java: [ Source ] [ Documentation ]

Tutorial Exercise #17: Implementing an Unbounded Binary Heap

• Problems To Be Solved

Lecture #18: Applications of Binary Heaps

• Lecture Notes
• Questions for Review

Tutorial Exercise #18: Making Heap Sort a Little Bit More Efficient

• Problems To Be Solved

Lecture #19: Quick Sort

• Lecture Notes
• Questions for Review

Tutorial Exercise #19: Quick Sort

• Problems To Be Solved

Assignment #3: Improving the Performance of Merge Sort

• Problems To Be Solved
  
  
• BetterMergeSort.java: Java program to be completed
  
  
• TestSort.java: JUnit programs (in the “cpsc.assignment3” package) for the program you are to complete

cpsc 331 computer science faculty of science u of c

cpsc 331 introduction algorithm analysis basic data structures
& adts binary search trees hash tables searching and sorting graph algorithms conclusion java development assignments tests