Lecture 1

Search binary search sort selection sort bubble sort

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Central Processing Unit • Bits, Bytes, and Words 15 ALGORITHMS • What is an Algorithm? • Search: Binary Search • Sort: Selection Sort Bubble Sort 16 MATERIAL COVERED IN 114 • Quick Review and Advanced Features of C++ • Abstract Data Types • Sorting Algorithms • Complexity Theory 17 C++ (APPENDIX A) • Basics • I/O using iostream • One-dimensional Arrays • Multidimensional Arrays • Structures • Files 18 C++ (CHAPTER 4) • Pointers • Linked Lists • Circular Linked Lists • Other kinds of Linked Lists 19 ABSTRACT DATA TYPES • Basics (Chapter 3) • Stacks (Chapter 6) • Queues (Chapter 7) • Trees (Chapter 10) • Graphs (Chapter 13) • Priority Queues (Chapter 11) 20 SORTING ALGORITHMS • Quick Review of Selection Sort and Bubble Sort (Chapter 9) • Insertion Sort • Quicksort and Mergesort • Radix Sort • Heap Sort (Chapter 11) 21 COMPLEXITY THEORY • How “fast” are search algorithms? • How “fast” are sort algorithms? 22 COMPUTER USE • TURBO C++ on PC • or ... g++ (Gnu Compiler) on SUN • COMPUTER USE IS MANDATORY 23 INITIAL PREPARATION • Read Chapter 1 and Appendix A till next class • Chapter 1 will not be covered in the lecture 24 THIS IS THE END OF THE INTRODUCTORY REMARKS. WE ADVANCE TO THE LECTURE, APPENDIX A. 25...
View Full Document

Ask a homework question - tutors are online