-
Growth of Functions
BACK: Key Ideas NEXT: Sorting Algorithms
-
Key Ideas
BACK: Introduction Key Idea #0: UNDERSTAND THE ALGORITHM After helping students with this class for a year, I’ve found that the biggest difference between the students that ‘get it’ and the students that ‘don’t’ is that those that get it: you need to understand the algorithm. You’re never going to...
-
Algorithms Introduction
BACK: Table of Contents Introduction When you’re playing your favorite card game with your buddies and you’re given 13 cards, how do you go about sorting your cards? Do you just sort of scan through each card to find where it would go? Do you start with the first card...
-
Algorithms Table of Contents
BACK: Classes Preface I took this class in Fall of 2017 with Florin Rusu. I also realized in the Spring of 2018, when I tutored the class, that I didn’t know squat (as is the case with many things in CS). The FA ‘18 ran smoother, but I still would...
-
Algorithms Table of Contents
BACK: Classes Introduction I took this class in Fall of 2017. Right now, I’m just going to put down random notes. Master’s Theorem Examples: Proving Big Theta Definitions In-Place Algorithm: Sorts/whatever in the same data structure (doesn’t allocate new memory). i.e: Insertion Sort is in-place, while merge sort, which creates...
-
Computer Organization
PREVIOUS: Classes
-
Data Structures
PREVIOUS: Classes Preface The pace picks up here a bit as opposed to CSE 020 and CSE 021, but it’s still not too bad. I took this class in the Spring of 2017. The goal of this class: Do all of the concepts learned in CSE 020/021 in C++. Basic...
-
Intro to Programming 2
PREVIOUS: Classes Preface I didn’t take this class, but self-studied the concepts in the Fall of 2016. The goal of this class: Continuing exploring the ideas used as a programmer using Java Be introduced to the ideas of Object Oriented Programming Go through the headache that is recursion Methods and...