i am learning about big o notation and need a little bit of clarity before i diverge into the wrong path. my understanding is o() is suppose to represent the time it takes for a program to do a task and 'n' is suppose to represent the element/data. so if we have o(n), that means how fast a program takes to parse 'n' elements. im confused on things like O(log n) because how can we have 'log n' elements? Is my understand completely wrong and need to take a step back? if someone could run me down the notations and fact check me that great