Sorry, your browser is not supported
To have the best experience using Skillshare, we recommend that you use one of these supported browsers.

Computer Science 101: Master the Theory Behind Programming

Kurt Anderson, Computer Scientist, Multi-Media Designer

Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
33 Videos (5h 19m)
    • Time Complexity Introduction

      2:12
    • N-notation

      18:55
    • Big O Notation

      12:58
    • Real World Big-O Example

      9:51
    • How is Data Stored

      8:38
    • Fixed Arrays

      20:28
    • Circular Arrays

      8:00
    • Dynamic Arrays

      15:51
    • Array Review

      7:57
    • Nodes

      4:19
    • Linked List

      13:36
    • Linked List Run Times

      14:59
    • Doubly Linked Lists

      8:07
    • Tail Pointer

      5:14
    • Linked List Review

      3:31
    • Stacks

      9:41
    • Stack Example

      11:05
    • Queues

      8:48
    • Queue Examples

      9:42
    • Queue and Stack Run Times

      6:03
    • Sorting Algorithm Introdcution

      1:40
    • Bubble Sort

      10:12
    • Selection Sort

      9:49
    • Insertion Sort

      9:03
    • Quick Sort

      14:38
    • Quick Sort Run Times

      10:31
    • Merge Sort

      11:57
    • Merge Sort Run Times

      7:39
    • Stable vs Nonstable

      6:34
    • Basics of Trees

      7:37
    • Binary Search Tree

      8:34
    • BST Run Times

      7:36
    • Tree Traversals

      13:04
25 students are watching this class