Algorithms
This sorting algorithm steps through a list and compares adjacent elements. Elements in the wrong order are swapped
What is bubble sort?
This sorting algorithm iterates through a list to find the smallest item and moves it to the front. This happens repeatedly to the unsorted portion of the list until it is sorted.
What is selection sort?
This technique allows us to solve complex problems by breaking them down into smaller overlapping subproblems
What is dynamic programming
This code is an example of _______:
def f(x):
if x == 1:
return x
else:
f(x-1)
What is recurssion
This is logarithmic time complexity.
What is O(nlogn)