:For the algorithmic performance concept 'constant factor', see Big O notation.
Big Finish Productions | Big Brother | Big Ten Conference | The Big Bang Theory | Big Dipper | Reel Big Fish | Big Ben | The Big Lebowski | Big Finish | Big Ten Network | Big Sur | big band | Big Day Out | Big Brother and the Holding Company | Big Bang | Big 12 Conference | List of Doctor Who audio plays by Big Finish | Big Brother (TV series) | Big East Conference (1979–2013) | Big Bird | Big Bend | Little Big Town | Great Big Sea | Big Star | Big Daddy Kane | Big Band | The Big Valley | Big Time Rush | Big Star (band) | Big Love |
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).
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.