
	Where results make sense

Topic: Sorting

Related Topics

sort algorithm

Bubble sort

insertion sort

Merge sort

Shell sort

List of dances sorted by ethnicity

Selection sort

The Sorting Hat

Radix sort

bucket sort

Comb sort

Cocktail sort

In the News (Tue 21 May 13)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Card Sorting (Design Usability Resources) - Information & Design
		Card Sorting is a technique for exploring how people group items, so that you can develop structures that maximize the probability of users being able to find items.
		Card Sorting is appropriate when you have identified items that you need to categorize.
		Card Sorting can be conducted in a variety of circumstances using various means - one-on-one, during workshops, by mail, or electronically.
	www.infodesign.com.au /usabilityresources/design/cardsorting.asp (603 words)

	CIS Department > Tutorials > Software Design Using C++ > External Sorting
		External sorting refers to the sorting of a file that is on disk (or tape).
		Internal sorting refers to the sorting of an array of data that is in RAM.
		After the sorted runs have been generated, a merge algorithm is used to combine sorted files into longer sorted files.
	cis.stvincent.edu /html/tutorials/swd/extsort/extsort.html (1298 words)

	Sorting - Wikipedia, the free encyclopedia
		Sorting in computer science is one of the most extensively researched subjects because of the need to speed up the operation on thousands or millions of records during a search operation; see sorting algorithm.
		Sorting is also a naturally occurring process that results in the concentration of ore.
		Sorting results from the application of some criterion or differential stressor to a mass to separate it into its components based on some variable quality.
	en.wikipedia.org /wiki/Sorting (699 words)

	Sorting Algorithms
		Some sorting algorithms are simple and intuitive, such as the bubble sort.
		Since the speed of a sort can vary greatly depending on what data set it sorts, accurate empirical results require several runs of the sort be made and the results averaged together.
		Even using the shell sort, users are going to be twiddling their thumbs if you try to sort much more than 10,000 data items.
	linux.wku.edu /~lamonml/algor/sort/sort.html (696 words)

	Sorting Summary
		The sorting is not accomplished in one pass over the entire sequence, however, and as many passes are needed as there are values to be sorted.
		Sorting in computer science is one of the most extensively researched subjects because of the need to speed up the operation on thousands or millions of records during a search operation; see sorting algorithm.
		Sorting is also a naturally occurring process that results in the concentration of ore.
	www.bookrags.com /Sorting (1438 words)

	Information design using card sorting
		The card sorting is likely to start slowly at first, as the participants get the hang of how it all works.
		The card sorting session should also be fun: a good distraction from the day-to-day activities of the user.
		The card sorting itself is just another input into this process: it does not generate the final structure.
	www.steptwo.com.au /papers/cardsorting/index.html (4060 words)

	HowTo/Sorting - PythonInfo Wiki
		There are many ways to use it to sort a list and there doesn't appear to be a single, central place in the various manuals describing them, so I'll do so here.
		Sort takes an optional function which can be called for doing the comparisons.
		The sort is stable - if two items have the same key, their order will be preserved in the sorted list.
	wiki.python.org /moin/HowTo/Sorting (1310 words)

	Review of Sorting
		Sorting is the process of putting data into a defined order.
		Sorting is one of the most fundamental tasks in computer science.
		However, the efficiency of a given sorting algorithm often varies greatly depending on the particular data set it is used on.
	www.sparknotes.com /cs/sorting/review/summary.html (310 words)

	A Fresh Look at Efficient Perl Sorting
		Sorting is the rearrangement of a list into an order defined by a monotonically increasing or decreasing sequence of sortkeys, where each sortkey is a single-valued function of the corresponding element of the list.
		Sorting theory and algorithms usually ignore the cost of this association, as it is typically a constant factor of the comparison operation.
		Consider the common problem of sorting a two-dimensional data structure, a list of references to arrays or to hashes, where the sortkeys are functions of the values of the submembers.
	www.sysarch.com /perl/sort_paper.html (4816 words)

	Card Sorting: How Many Users to Test (Jakob Nielsen's Alertbox)
		Because card sorting uses no technology, this photo of a 1995 card sort looks the same as one conducted today.
		The main quantitative data from a card sorting study is a set of similarity scores that measures the similarity of user ratings for various item pairs.
		Much of the value from card sorting comes from listening to the users' comments as they sort the cards: knowing why people place certain cards together gives deeper insight into their mental models than the pure fact that they sorted cards into the same pile.
	www.useit.com /alertbox/20040719.html (1590 words)

	United States Team Sorting Association
		Standard Sorting is three riders and ten cows numbered from 0 through 9, the cattle are sorted in order from the number given as you cross the first line ten feet before the 50 feet foul line.
		Ranch Hand Sorting this is were there are two pens that are 54’ to 60’ in diameter with a 12’ opening in the middle, there are ten cows numbered from 0 through 9.
		The purposes of United States Team Sorting Association, Inc. are to encourage and promote the sport of team sorting: to establish and maintain a national organization of persons engaged in team sorting: to gather, prepare and disseminate information about team sorting to sorters, prospective sorters, sponsors, the media and to the general public.
	www.teamsorting.net /index.htm (484 words)

	Sorting algorithm - Wikipedia, the free encyclopedia
		Efficient sorting is important to optimizing the use of other algorithms (such as search and merge algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing data and for producing human-readable output.
		Sorting algorithms are prevalent in introductory computer science classes, where the abundance of algorithms for the problem provides a gentle introduction to a variety of core algorithm concepts, such as big O notation, divide-and-conquer algorithms, data structures, randomized algorithms, best, worst and average case analysis, time-space tradeoffs, and lower bounds.
		Bubble sort is a straightforward and simplistic method of sorting data that is used in computer science education.
	en.wikipedia.org /wiki/Sorting_algorithm (2672 words)

	ZING - Proposal: Sorting in CQL
		Sort criteria may not be specified as part of the query language, as is common in other query languages such as SQL.
		That the sorting capabilities of SRU 1.0 were not revised in version 1.1 does not reflect satisfaction with the old specification so much as lack of impetus at that time to design a better mechanism.
		Sort by date: records that have no date field are sorted as though they had a date of 1970.
	zing.z3950.org /cql/sorting.html (1224 words)

	Globalization Step-by-Step: Sorting and String Comparison (Site not responding. Last check: )
		If you are sorting only a small number of elements, the easiest and quickest solution is to use the string comparison techniques explained previously, and then to sort elements based on the result of those comparisons.
		Elements are sorted based on script (that is, all Greek characters sort together, all Cyrillic characters sort together, and so on); alphanumeric and symbolic characters; diacritics; case; and other special rules, such as two characters sorting as a single character (for example, the Spanish "CH").
		For example, a sort order for Russian would be based on Cyrillic letters and possibly diacritics, but a sort order for Japanese might be based on the number of strokes it takes to draw a character.
	www.microsoft.com /globaldev/getwr/steps/wrg_sort.mspx (2709 words)

	Sorting
		Selection sort maintains a growing `front' section of the array which is (i)sorted and (ii)less than the remainder of the array.
		At some intermediate stage, a[1..i-1] is sorted and, on an element by element basis, less than everything in a[i..N].
		Selection sort is not stable, the is the relative order of equal keys is sometimes changed.
	www.csse.monash.edu.au /~lloyd/tildeAlgDS/Sort (237 words)

	Scheduling analysis and cell sorting
		On the morning of the sort, the instrument is flushed with sterile sheath buffer for one hour prior to sorting.
		Immediately prior to the sort, a disposable sterile 0.2 um high-pressure fluid filter (Spectrum Mediacap) is installed on the sheath tank on the inlet line, providing an additional barrier to contamination.
		Due to its complexity, cell sorting is generally considered to be an aseptic process (as opposed to truly sterile).
	home.ncifcrf.gov /ccr/flowcore/schedule.htm (1343 words)

	Color Sorting Coffee
		Color sorting is frequently used to remove the defects that were not removed during processing or hulling.
		Many countries sort coffee by hand due to inexpensive labor, but for most countries investment in a color sorting machine is necessary.
		The color of each bean is quickly measured using a type of CCD camera system and depending on this wavelength measurement the bean is either allowed to flow downward or is shot with a puff of air into the reject pile.
	www.coffeeresearch.org /agriculture/colorsorting.htm (190 words)

	Research Facilities - Cell Biology - Cell Sorting Facility at Fox Chase Cancer Center (Site not responding. Last check: )
		The facility analyzes and sorts cell populations using a FACS-VantageSE/DiVa equipped with three lasers, one UV-capable.
		Sorting is monitored by two CCD video cameras, facilitating sorts lasting for extended periods (>1 hour).
		For large-scale cell separations, pre-fractionation of cells prior to electronic cell sorting by use of magnetic bead technology is available using a Milteny Biotek MACS device in the facility.
	www.fccc.edu /research/facilities/cell/CellSorting.html (498 words)

	Sorting
		This is another simple sorting algorithm, which is based on the principle used by card players to sort their cards.
		The method derives its efficiency from the fact that insertion sort is able to exploit the order present in a partially sorted input file; input files with more order to them require a smaller number of exchanges.
		Sort them (by direct comparison) so that the median of the three is in a[middle] and the largest is in a[right].
	web.mit.edu /1.124/LectureNotes/sorting.html (1734 words)

	VB Helper Tutorial: Sorting It Out
		Sorting using trees is generally pretty fast, but there are many other sorting algorithms that are less complicated and some of them, like countingsort, are much faster.
		Bubblesort is a specialized algorithm designed for sorting items that are already mostly in sorted order.
		You will need to sort small lists many times to see that selectionsort is faster than quicksort and countingsort for very small lists.
	www.vb-helper.com /tut1.htm (3013 words)

	Sorting
		Since sorting is such a common thing, I took a look at far cousin C, where I knew there is a predefined function to perform a QuickSort.
		Now the only thing that is of interest to the user of the sorting component is the iComparer interface of these classes.
		The reason is that the code required to sort a simple array or collection is not as simple as I would like it.
	users.skynet.be /wvdd2/Sorting/sorting.html (2533 words)

	Sorting Networks
		An horizontal line represents each input of the sorting network and a connection between two lines represents each comparator which compares the two elements and exchanges them if the one on the upper line is larger than the one on the lower line.
		The input of the sorting network is on the left of the representation.
		Elements at the output are sorted and the largest element migrates to the bottom line.
	www.cs.brandeis.edu /~hugues/sorting_networks.html (628 words)

	The xSortLab Applet
		The time required to sort one array can be obtained by dividing the total time by the number of arrays.
		For a visual sort, the number of copies and the number of comparisons are recorded.
		For a timed sort, all the statistics that are displayed in the "Timed Sort" panel are written to the log.
	math.hws.edu /TMCM/java/xSortLab (1112 words)

	Sorting -- Getting it Straight
		A refinement of bubble sort is to reverse direction on each pass of bubble sort.
		The importance of tree sort is that it generalizes to an important algorithm: heapsort.
		Distribution counting sort is stable: numbers with the same value appear in the output array in the same order as they were in the input array.
	www.cs.fit.edu /~wds/classes/cse5081/Sort/sort/sort.html (5028 words)

	Sorting Algorithms Demo
		Some of these sorts are very stupid or very slow and should not be used in code.
		One of my favorite references to sorting routines is "Sorting" by William A. Martin, in ACM Computing Surveys, Volume 3, Number 4, December 1971, pages 147-174.
		The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years.
	www.cs.ubc.ca /spider/harrison/Java/sorting-demo.html (527 words)

	Sorting Algorithms
		Sort algorithms which only use an abstract key comparison operation always need at least O(n log n) comparisons on average; while sort algorithms which exploit the structure of the key space cannot sort faster than O(n log k) where k is the size of the keyspace.
		This is actually a pretty important case as often sorting is actually resorting of previously sorted data done after minimal modifications of the data set.
		Insertion sort and selection sort are seen to be instances of merge sort and quicksort, respectively, and sinking sort and bubble sort are in-place versions of insertion sort and selection sort.
	www.softpanorama.org /Algorithms/sorting.shtml (3638 words)

	GPU Sorting
		Sorting is a fundamental and universal problem in computer science.
		We consier this sorting with the GPU; using the GPU to sort values.
		We describe a novel sorting algorithm that performs comparisons between the primitives by performing occlusion queries on the GPUs.
	www.cs.unc.edu /~geom/SORT (800 words)

	4. Sorting (Site not responding. Last check: )
		Sorting is commonly used as the initialization step for another algorithm, such as: Binary Search.
		The bad side of this sorting algorithm is this algorithm need 2*the size of initial array to perform it's task.
		The better way to do multi field sorting is to modify the compare_function in such a way that you break ties accordingly...
	www.comp.nus.edu.sg /~stevenha/programming/prog_sorting1.html (2014 words)

	Sorting
		In all cases, assume we are sorting an array of n elements--that is, a prototype for such a function is:
		References to a and n in the following sections are to the array being sorted and to its length, respectively.
		Then use quicksort [recursively] to sort the part of the array "above" the pivot in its found location and use quicksort [recursively] to sort the part of the array "below" the pivot.
	cba.winthrop.edu /thackerw/csci208/LabHandouts/sorting.htm (917 words)

	Sorting - Algorithmist
		Sorting is probably the most fundamental algorithm in Computer Science.
		A sorting algorithm takes a list as the input, and returns a list in an order.
		It is often the first step in many algorithms, and thus setting the lower bound for complexity.
	www.algorithmist.com /index.php/Sorting (102 words)

Try your search on: Qwika (all wikis)