O(nlogn), O(n2), and O(n3) are tractable growth rates as they allow algorithms to run in polynomial time relative to the input size n. O(2n), O(nn), O(n!), and O(n10) are not tractable as they represent exponential or factorial growth rates which cause algorithms to have computation times that grow too quickly as n increases.