CSC 143/Chapter 13
From charlesreid1
Chapter 13: Searching and Sorting
Sections:
13.1 Searching and sorting in the Java class libraries
13.2 Program complexity
13.3 Implementing searching and sorting algorithms
13.4 Case study: implementing merge sort
Section 13.1: Searching and Sorting in Java Class Libraries
Material
Binary search
Sorting
Shuffling
Custom ordering with comparators
Section 13.2: Program Complexity
Material
Empirical analysis
Complexity classes
Section 13.3: Implementing Searching and Sorting Algorithms
Material
Sequential search
Binary search
Recursive binary search
Searching objects
Selection sort
Section 13.4 Case Study: Implementing Merge-Sort
Material
Splitting and merging arrays
Recursive merge sort
Complete program
Chapter 13 Summary
Deliverables
Chapter 13 Homework
HW Questions
(Recommended) Self-check problems:
(Required) Exercises:
(Required) Projects:
HW Details
Self-check:
Exercises:
Projects:
Chapter 13 Code
Lecture Code
Worksheet Code
Chapter 13 Goodies
Quotes
Profiles
Puzzle 6
Modular exponentiation, Fermat's Little Theorem, Euler's Theorem, relative prime
Puzzles/Crypto Level 2/Puzzle 6
Flags
 |
CSC 143 - Intro to Programming II Computer Science 143 - Intro to Programming II, South Seattle College.
Chapter 8: Object Oriented Reivew CSC 143/Chapter 8 Chapter 9: Inheritance and Interfaces CSC 143/Chapter 9 Chapter 10: ArrayList CSC 143/Chapter 10 Chapter 11: Java Collections Framework CSC 143/Chapter 11 Chapter 12: Recursion CSC 143/Chapter 12 Chapter 13: Searching and Sorting CSC 143/Chapter 13 Chapter 14: Stacks and Queues CSC 143/Chapter 14 Chapter 16: Linked Lists CSC 143/Chapter 16
Category:Teaching · Category:CSC 143 · Category:CSC Related: CSC 142 Flags · Template:CSC143Flag · e |