Skip to content
Advertisement

Tag: data-analysis

Experimental Analysis of an Algorithm – How to prove that the graph is O(nlogn)?

This question is probably stupid, but I’ve been trying to figure this out for hours and I still couldn’t find anything about it. Probably I’m just too lost. So basically, I’m analysing an algorithm by doing an asymptotic and experimental analysis. The asymptotic analysis went well and I concluded that my algorithm is O(nlogn). The problem is the experimental analysis.

Advertisement