Question

I need to write a program (a project for university) that solves (approx) an NP-hard problem.
It is a variation of Linear ordering problems.
In general, I will have very large inputs (as Graphs) and will try to find the best solution
(based on a function that will ‘rate’ each solution)

Will there be a difference if I write this in C-style code (one main, and functions)
or build a Solver class, create an instance and invoke a ‘run’ method from a main (similar to Java)

Also, there will be alot of floating point math going on in each iteration.

Thanks!

Answer 1

No.

The biggest performance gains/flaws will be on the algorithm you implement, and how much unneeded work you perform (Unneeded work could be everything from recalculating a previous value that could have been cached, to using too many malloc/free’s vs using memory pools,
passing large immutable data by value instead of reference)