Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
Matlab has no means to analyze big O complexity of an algorithm.
Nevertheless, you could get experimental results for different values of "n" using the profiler or measuring time with "tic" and "toc", and in this way observe the trend when "n" grows. (In you mesure time, take into account that the first run takes more time.)
Regards
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
