Pythony Things
Variables in Python aren't strongly typed, allowing for easy reassignment of variables. This is due to this property of Python variables.
What is dynamically typed?
Often used with Linked Lists, these types of functions are used to travel through the nodes.
What is recursion?
This sort relies on having a position where all values to the left of it are in the "sorted half".
What is an insertion sort?
Merge Sort
What is O(NlogN)?
These are the main types of errors you've dealt with in Python.
What are syntax, semantic, and Runtime errors?
This type of functions is much more efficient then a generally recursive function, while still maintaining it's recursive properties.
What is a tail recursive function?
When print statements aren't enough, this tool can help you pinpoint exactly what's going on, either logically or before your code breaks.
What is the debugger?
This sort relies on 2 different functions. One to "split" the list up on even and odd indexes, and another to "-----" them back together.
What is a merge sort?
Quick Sort
What is O(NlogN), O(NlogN), O(N * N)?
This Linked Structure relies on the fact that it has 2 links instead of one. It can be sorted but doesn't have to be.
What is a binary Tree?
2 Part Question: This is commonly used when you need to pass values through a function.
These are then passed through
What are parameters and arguments?
When you want to do something to every item in a list, you often use this type of iteration.
What is a for-each loop?
This sort uses pivots and lots of empty lists in order to sort
What is quick Sort?
Dictionaries
What is O(1)?
This is used to stop a recursive function from... well recursing.
What is a base case?
Since Python doesn't have "objects" built in, it uses these to make up for it.
What are dataclasses?
What are structs?
This term is often used to describe a function which returns a value, but only at RIT really... Only in CS1 and 2 to be honest.
What is a fruitful function?
This sort relies on finding the largest value and then putting it into a new list.
What is selection sort?
Binary Search
What is O(logN)?
This is done in order to make a dataclass hashable.
What is frozen?
We often use lists to store data in Python. Behind the scenes lists are actually made up of these, something you can't directly access normally
What are arrays?
These datastructures rely on nodes in order to function. One if FIFO, one if FILO, and another has no set order
What are queues, stacks, and LinkedLists?
Not actually a sort, however, this search can only be used on a sorted list.
What is a binary search?
Insertion Sort
What is O(N), O(N * N)?
These are used to go through binary trees in a specific order, with the value coming first, middle, and last.
What are prefix, infix, and postfix traversals?