
	Where results make sense

Topic: Linearithmic

Related Topics

Big O notation

Constant

Computer science

In the News (Sun 7 Sep 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	CONK! Encyclopedia: Linearithmic (Site not responding. Last check: 2007-10-08)
		In computer science, a linearithmic function is one of the form n Â· log n (i.e., a product of a linear and a logarithmic term).
		In terms of complexity, linearithmic is Ï(n), O(n
		Thus, a linearithmic term grows faster than a linear term but slower than a quadratic term.
	www.conk.com /search/encyclopedia.cgi?q=Linearithmic (58 words)

	Analysis of Algorithms
		We refer to the running time of such programs or algorithms simply as logarithmic, linear, linearithmic, quadratic, cubic, exponential, factorial, and so forth.
		Give table showing effects of a faster computer for linear, linearithmic, qudratic, cubic, exponential, and factorial algorithm on existing 1GHz computer (say in 1 minute), on 5GHz computer on supercomputer 1,000 times as fast.
		Is the algorithm have linear, linearithmic, quadratic, cubic, or exponential?
	www.cs.princeton.edu /introcs/41analysis (5344 words)

	AlgorithmA 2005
		Almost all conventional sorting algorithms work by comparison, and in doing so have a linearithmic greatest lower bound on the algorithmic time complexity.
		Such a sort algorithm needs to use an alternative method for ordering the data than comparison, to exceed the linearithmic time complexity boundary on algorithmic performance.
		The hash sort is a general purpose non-comparison based sorting algorithm by hashing, which has some interesting features not found in conventional sorting algorithms.
	www.csci.csusb.edu /public/class/cs455/cs455_2005/proto16/javatest/Sort/Hash/hashGenInfo.php?menuOpen=sort (229 words)

	Encyclopedia: Cooley-Tukey FFT algorithm (Site not responding. Last check: 2007-10-08)
		The above re-expression of a size-n DFT as two size-n/2 DFTs is sometimes called the Danielson-Lanczos lemma, since the identity was noted by those two authors in 1942 (influenced by Runge's 1903 work).
		They applied their lemma in a "backwards" recursive fashion, repeatedly doubling the DFT size until the transform spectrum converged (although they apparently didn't realize the linearithmic asymptotic complexity they had achieved).
		The Danielson-Lanczos work predated widespread availability of computers and required hand calculation (possibly with mechanical aides such as adding machines); they reported a computation time of 140 minutes for a size-64 DFT operating on real inputs to 3-5 significant digits.
	www.nationmaster.com /encyclopedia/Cooley_Tukey-FFT-algorithm (2200 words)

	php-deluxe.net - description Linearithmic
		In computer science, a linearithmic function (mathematics) is one of the form n · log n (i.e., a product (mathematics) of a linear and a logarithmic term).
		In terms of Big O notation, linearithmic is ω(n), O(n 2), and Θ(n · log n).
		Some famous Algorithms that run in linearithmic time include: Quicksort on the average (performance) case The Fast Fourier transform *Monge array calculation
	www.php-deluxe.net /wiwimod,index.page,Linearithmic.htm (105 words)

	Learn more about Linearithmic in the online encyclopedia. (Site not responding. Last check: 2007-10-08)
		Learn more about Linearithmic in the online encyclopedia.
		Enter a phrase or search word in the box below.
		Hint: Play with putting spaces before and after your words to see the different results you get.
	www.onlineencyclopedia.org /l/li/linearithmic.html (150 words)

	Space-time tradeoff - Wikpedia (Site not responding. Last check: 2007-10-08)
		In the case of the sorting problem, a space-time tradeoff can be made by using a different algorithm such as binary tree sort.
		Its memory requirement is O(n) (linear), but its time requirement is O(n lg n) ("linearithmic") which is good for a sort algorithm.
		Binary tree sort's time requirement grows more slowly than bubble sort's, but its memory requirement grows faster.
	www.bostoncoop.net /~tpryor/wiki/index.php?title=Space-time_tradeoff (300 words)

	[vox-tech] Matching Contents of Lists
		Not counting the complexity involved for whatever sort algorithm you use.
		If you use Perl's sort function, you'll get linearithmic time (N log N).
		Test the hell outta your code before relying upon it.
	www.lugod.org /pipermail/vox-tech/2005-July/011394.html (574 words)

	INFO 450 Java Chapter 21 Notes
		The Sort class is a generic and stable-sort (does not reorder equal-valued elements in a structure) method.
		As we have studied, using the Big Oh notation, the relative prowess and complexity theory of various algorithms previously, the Sort in the Collections API is a linearithmic (N log N) method.
		This is an interesting algorithm designed to do just what it says it will: randomly reorder elements in a List.
	www.isy.vcu.edu /~jbabb/notes/INFO450/info_450_java_22_notes.html (1001 words)

Try your search on: Qwika (all wikis)