Friday, September 19, 2014

Changes 9/19/14

Java:

  • Finished up the eimacs hash table section
  • I feel like it wrapped up too quick, it just showed the basics without really talking about advanced hash collision strategies and stuff like that
  • Started looking at sorting algorithms
  • It's walking me through how an in-place quicksort works, which is when an array is sorted just by swapping the placement of elements
  • It's very complicated, but they do a good job of walking you through it slowly
  • They have an interactive example where it highlights the step the program is on, and explains what is being done

1 comment:

  1. Please continue to use the Data Structures in Java book as well as the eIMACS resource. eIMACS will provide nice high level intros and a convenient way for us to test your understanding, but the Data Structures book will go into much greater depth.

    ReplyDelete