This unit is about Data Structures

By the end of this unit you should know

• how to find the largest # in an unsorted array (1D or 2D)
• the difference between insertion and selection sort
• how to code one of the two sorts above
• how to create an arraylist
• arraylist operations: print, search, add, delete
• how to use for-each loops to search / print these data structures (arrays, arraylists)
• pros and cons of for-each loops
• what a queue is and where one is used
• what a stack is and where one is used
• how to create a hashmap
• When to use a hashmap instead of arraylist
• hashmap operations: print, search, add, delete