×
Log in to StudySoup
Get Full Access to UCLA - INTRO 32 - Class Notes - Week 7
Join StudySoup for FREE
Get Full Access to UCLA - INTRO 32 - Class Notes - Week 7

Already have an account? Login here
×
Reset your password

com sci 32 class notes

com sci 32 class notes

Description

School: University of California - Los Angeles
Department: Computer Science and Engineering
Course: Intro to Computer Science II
Professor: Nachenberg/smallberg
Term: Winter 2016
Tags: Big O Notation, Algorithm, run, time, complexity, STL, and c++
Cost: 25
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.
Uploaded: 05/26/2018
5 Pages 165 Views 0 Unlocks
Reviews