X-Nico

unusual facts about Big O notation


The Constant Factor

:For the algorithmic performance concept 'constant factor', see Big O notation.


Betweenness centrality

On a sparse graph, Johnson's algorithm may be more efficient, taking Move-to-front transform

For encoding, no clear advantage is gained by using a linked list, so using an array to store the list is acceptable, with worst case performance O(nk), where n is the length of the data to be encoded and k is the number of values (generally a constant for a given implementation).

Volker Strassen

In 1971 Strassen published another paper together with Arnold Schönhage on asymptotically-fast integer multiplication based on the fast Fourier transform; see the Schönhage–Strassen algorithm.


see also