CSC 382 Analysis of Algorithms

▪ 01-27 (Tue): Syllabus

Iteration

  • Minimum and Maximum
  • Top-2
  • Polynomial
▪ 01-29 (Thu):
  • Rotate an Array

Recursion

  • Sum an Array Using Recursion
  • Highest Element in an Array Using Recursion

Binary Search

  • First Occurrence
  • Negative Numbers
▪ 02-03 (Tue):
  • Find Peak Element

Vectors

  • Add an Element at the End
  • Circular Queue
  • Address of Element of Matrix

Linked Lists

  • Middle of the Linked List
  • Linked List Cycle
  • Intersection of Two Linked Lists
▪ 02-05 (Thu):
  • Implement Queue using Stacks

Hash Tables

  • Sort Characters by Frequency
  • Two Sum
  • Longest Substring Without Repeating Characters
▪ 02-10 (Tue):

Binary Search Trees