BIT 143:Programming & Data Structures in C++ Instructor: Mike Panitz

BIT 143: Data Structures2 Today Today’s Topics: –Recursion, Part 2 –Performance Analysis: Sequential & Binary Search BubbleSort, Selection Sort Carrano, Ch 9(pg ) Reading for next class: –Finish today’s material –QuickSort: Carrano, Ch 9

BIT 143: Data Structures3 BIT 265 –Data Structures and Algorithms Self-balancing BSTs (AVL trees, Red-Black Trees), Graphs (“How can you find the shortest route between two places?”) Hash tables Sorting & searching / Analysis Dynamic programming And More!! (Now Accepting Requests… ) –Excellent prep for UWB/CSS –Tu, Th 1:15-3:20pm –5 Credit, college class NEXTTERMNEXTTERM NEXTTERMNEXTTERM

BIT 143: Data Structures minute ‘Monday Night Help’ If you want to hand in 1 or (at most) 2 assignments (or revisions to assignments) past the Nov 30 th deadline (penalty-free) that would be ok. HOMEWORKHOMEWORK HOMEWORKHOMEWORK

BIT 143: Data Structures5 Need to implement one of: –Re-sizable array (when your queue runs out of space, allocate more & copy the old tickets into it) –Circular Queue (so that completed tickets are overwritten) –Linked-list based queue (So your code can continue to add new tasks to the list) HOMEWORKHOMEWORK HOMEWORKHOMEWORK A3 feedback

BIT 143: Data Structures6 Homeworks Notice that in the syllabus that November 30 th, AT THE BEGINNING OF THE LECTURE, is the last point in time at which you can hand something in. –This includes homework assignments, both the first version, and any revisions to any homeworks –You may submit one or two homeworks (or revisions to homeworks) after that date. Homeworks