CS 2114 Lecture Notes - Lecture 18: Mobile Suit Gundam, Insertion Sort, Selection Sort
29 Mar 2018
School
Department
Course
Professor
Document Summary
Project v preliminary submission is due designs will be due monday, april 9; Project v final submission is due thursday, april 26. Continue with queue/deque/sorting opendsa and homework assignments (due sunday, april 1 and sunday, april 8). ***note: recall that the textbook begins list implementations at spot one. Replacing a list entry requires us to replace the data portion of a node with other data use getnodeat(givenposition) Inserting: make room (shift entries beginning with the last element) use private helper method makeroom(newposition) Efficiency: see list reading notes for array, singly inked chains, and singly linked chains with head and tail reference. Consider the following ~ know how to order; consider the rules; understand what greater than or less than means for a specific class. Comparing primitive type char or string: use the ascii table. The java array class comes with some sorting algorithms. The java collections class comes with some sorting algorithms for list. Never use the bubble sort (cid:4666)(cid:4667)
