Stacka Algarithmic Improvements

Dafleme: Big on ation is the way that particular algriton a grows in terms of computational, computational time. If something is squared, then that means as the number of elements m increases, the time it takes to get the answer you want goes up expedentially. As i add more strings that i have to count the letters of am, i increase linearly. Am, if you're using,. like trees and hashing and things like that, you can actually do sublinear computations. That's where this big o notation becomes really important. It will tell you kind of the best case and the worst case. And so now whenever you start dealing with big values