c343/ Summer 2016 Homework04 Harrison Carter carterh
The order property of a binary search tree is that every node, must have a value that is greater than all the values in its left
subtree and less than all the values in its right subtree.
C343/Summer 2016, Homework03, Harrison Carter carterh
2 log3n log2n n^2/3 20n 2n^2 3n n!
a) if c=c1 n0=1
for all n>n0 c1n<=cn
b)c2n^3<= c2n^3+c3<=(c2 +c3)n^3
if c3 <0, c2n^3 + c3 <=c2n^3, for all n
cn^3<= c2n^3 +c3, and let t(n)=c2n^3 -
c434/summer 2016, homework 02, Harrison Carter carterh
-declare a local variable rating that referecnces a 2d array of integers