Quote:
Originally Posted by jtrv
So with some decent experience, I'll ask you a question that may give you some insight on the 'state' of FRC programming:
What is Big O? I've never heard of it.
|
I hadn't either until a few months ago, and I minored in computer science (1984). Back then, we just called it "order of magnitude". It tells you how resources required by a process (usually time) scales as the amount of data being handled increases. For example, a bubble sort is of order n
2 where n is the number of items being sorted, so "n
2" is the "big O" for the bubble sort, starting from an unsorted data set.