There is a new sorting algorithm a deterministic O (m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

A nested loop/recursive algorithm like the OP suggested might perform in n^2 expected time while a better algorithm might perform in n*log expected time, where the expectation is over the ...

An O (n log n) algorithm is given for solving the linear programming problem obtained by relaxing the integrality constraints in a zero-one programming formulation of the problem. This linear ...

Awi Federgruen, Michal Tzur, A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0 (n $\log$ n) or 0 (n) Time, Management Science, Vol. 37, No. 8 (Aug., 1991), pp.

CPUs have emerged as the winner for visualizing such data because of their memory capacity and ability to support O (log n) algorithms.