cst- 370- week 5 - learning journal

This week I focused on implementing sorting and graph algorithms in Java. I developed quicksort using Hoare’s partition method exactly as shown in the pseudocode and made sure to handle boundary issues carefully. I also implemented insertion sort and compared their performance using System.nanoTime to measure elapsed time. Testing different input orders helped me understand how recursion depth affects quicksort, especially with ascending data. In addition, I implemented Kahn’s algorithm for topological sorting in Java, computing in-degrees and processing vertices in ascending order. These labs strengthened my understanding of algorithm behavior and efficiency in practical Java implementations.

Comments

Popular posts from this blog

Week 2 Learning Journal 5 Parts

Week 4 Journal

BOOK REPORT EXTRA CREDIT