School: University of California - Los Angeles
Department: Computer Science and Engineering
Course: Intro to Computer Science II
Term: Winter 2016
Tags: Big O Notation, Algorithm, run, time, complexity, STL, and c++
Name: CS 32, Week 7: Algorithm Analysis
Description: This week, we finished up STL libraries and talked about the actual run time for an algorithm is, specifically runtime complexity in terms of N, and how to use Big O notation.