funky random ahh topics

Question 1

how is a stack used in recursion?

Answer 1

1. when a recursive function is called, each recursive stack is pushed into the call stack until the base case is reached
2. when the base case is reached, the run-time will return to the caller of the function by popping off the stack frame containing the return address and the values of the local variables are restored
3. the process of popping off the stack frame will continue until the control is back to the first caller to the function.

Question 2

what are some character encoding methods?

Answer 2

1. ASCII Code
2. Unicode (can display other characters and languages)

Question 3

just wanted to say that you’re doing great hehe remember to take frequent breaks too! ദ്ദി ˉ͈̀꒳ˉ͈́ )✧

Answer 3

hehe

Question 4

how to tell if a sorting algorithm is inplace?

Answer 4

if the sorting algorthim will take additional memory during runtime then it is NOT inplace (if it takes like O(1) additional space then its inplace!!)