My colleague is running some data-analysis tasks in R and has come up with an analysis that takes 4 days (!) on a dataset of 1.000.000 entries.
I'm looking into his R code to see if I can optimize this - because 4 days comes across as a bit much. So I had to dig up my Big-O knowledge again and came across this great reference website: http://bigocheatsheet.com/#
It gives an overview of the time complexity of sort and search operations for different algorithms.
No comments:
Post a Comment