CSE 100 Lecture Notes - Lecture 44: Big O Notation, Bubble Sort, Binary Search Algorithm
27 Apr 2018
School
Department
Course
Professor
Exam 4 Review
● Will have detailed questions such as writing short answer and writing a program will be
mainly from Ch. 9
● Chapter 9 →
○ Introduction to Search Algorithms
○ Searching an Array of Objects
○ Introduction to Sorting Algorithms
○ Sorting an Array of Objects
○ Sorting and Searching Vectros
○ Introduction to Analysis of Algorithms
● Search Algorithms
○ linear search
○ binary search
■ Sorting Algorithms
● bubble sort
● selection sort
● *Make sure you understand steps
of sorting algorithms
● Big O Notation
○ cin >> input;
○ cout << “Input is : MM uput << endl;
○ *2 steps = )(2) =. O(1): constant time
○ for(int i = 0; i<N; i++){
○ *statements(s)...
○ }
○ *N times iterates some statements = O(N*someNumber) = )(N): Linear Time
● Exam Structure→
○ True/False questions: 40 points
○ MC: 20 points
○ Short answer: 10 points
○ Write steps of sorting algorithms: 20 points
○ Write a part of program: 10 points
