Algorithms and OOD (CSC 207 2014F) : EBoards

CSC207.01 2014F, Class 35: Doubly-Linked Lists


Continue lab partners! (I didn't find the cards.)

Don't forget to vote today (provided you are permitted to do so)

Overview

Preliminaries

Admin

Upcoming Work

Cool Upcoming Events on Campus

Extra Credit

Academic

Peer Support

Notes on Homework 8

What are the required/optional parts?

Gremlins.

You have to do a lot of code reading to even get started on homework 8.

Why isn't my sort method working?

Those merge methods are weird

Can you go over the recursion in merge sort?

What's the theory between the shifting rather than swapping.

    6 0 7 3 6 5 4 2 0

Conceptual

    sorted | unsorted

Work 6|0 7 3 6 5 4 2 0 0 6|7 3 6 5 4 2 0 0 6 7|3 6 5 4 2 0 0 3 6 7|6 5 4 2 0 0 3 6 6 7|5 4 2 0 0 3 5 6 6 7|4 2 0 0 3 4 5 6 6 7|2 0

There's also a nice animated gif on Wikipedia.

Why swap, given that shift is more efficient?

Additional Non-HW Questions

Leftovers from Singly-Linked Lists

There are often multiple approaches to these problems, including some that I didn't think about.

Discuss the following questions with your partner(s).

Doubly-linked lists

Discuss with partner

Circularly-linked lists