Spring 2021 Workshop #1: Time Complexity and Big O Notation
Timestamps
00:00:00 - Introduction (Why is time complexity important, Big O Overview)
00:01:54 - O(1), Constant Time
00:07:50 - O(n), Linear Time
00:14:36 - Big O Notation
00:29:59 - Examples
00:25:36 - Array Sorting Algorithm and Data Structure Time Complexities
00:32:08 - Codewars examples
01:06:03 - Closing remarks, questions
Description: The workshop, titled Introduction to Time Complexity and Big O Notation, will introduce attendees to the concept of time complexity as it relates to algorithms. Attendees will also learn to understand algorithmic time complexities and find the time complexities of specific algorithms through worked examples. In addition, the workshop will cover Big O notation, defining what it is, when it is used and why you would want to use it.
Resources mentioned in video:
📂Hashmap vs. Hashtable:
https://stackoverflow.com/questions/4...
📂Python Dictionary Complexity:
https://stackoverflow.com/questions/1...
🎬Back To Back SWE:
/ @backtobackswe
**Join our workshops on Discord:
discord.gg/c5xMxSr
**Find out more about the IEEE UAlbany Student Branch:
https://www.albany.edu/~jo481765/IEEE/