All one really needs to know about Big-O is that nested data lists can be exponentially harder to process. If you understand that then you understand the need f

All one really needs to know about Big-O is that nested data lists can be exponentially harder to process. If you understand that then you understand the need for it and when the time arises for you to create these type of structures you'll calculate the time needed to process them accordingly using said method. In turn helping you predict future performance and avoiding bottlenecks.