From charlesreid1

Line 58: Line 58:


===Deliverables===
===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==
==Chapter 13 Goodies==

Revision as of 03:16, 15 September 2016

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

Flags