<p>What is the best/fastest way to sort Alphanumeric fields?  </p>

[{'answer_id': 78096, 'author': 'senfo', 'author_id': 10792, 'author_profile': 'https://Stackoverflow.com/users/10792', 'pm_score': 0, 'selected': False, 'text': '<p>You will find that most development libraries ship with an implementation of the quicksort algorithm, which is often the fastest sorting algorithm.  Check out the <a href="http://en.wikipedia.org/wiki/Quicksort" rel="nofollow noreferrer">Wikipedia link here</a>.</p>\n'}, {'answer_id': 78118, 'author': 'Ciaran', 'author_id': 5048, 'author_profile': 'https://Stackoverflow.com/users/5048', 'pm_score': 1, 'selected': False, 'text': '<p>You don\'t specify your target language, but whatever it is, it should have reliable, built-in sorting methods, so use one of them! For PHP...</p>\n\n<p>Load into an array and sort($array);</p>\n\n<p><a href="http://ie.php.net/sort" rel="nofollow noreferrer">php sort</a>...</p>\n\n<pre><code>$fruits = array("lemon", "orange", "banana", "apple");\nsort($fruits);\n\nforeach ($fruits as $key =&gt; $val)\n{\n    echo "fruits[" . $key . "] = " . $val . "\\n";\n}\n</code></pre>\n\n<p>Output:</p>\n\n<pre><code>fruits[0] = apple\nfruits[1] = banana\nfruits[2] = lemon\nfruits[3] = orange\n</code></pre>\n'}, {'answer_id': 78121, 'author': 'Brian R. Bondy', 'author_id': 3153, 'author_profile': 'https://Stackoverflow.com/users/3153', 'pm_score': 1, 'selected': False, 'text': '<p><a href="http://en.wikipedia.org/wiki/Bubble_sort" rel="nofollow noreferrer">Bubble sort</a>!  Just kidding :)</p>\n\n<p>Probably your best bet would be <a href="http://en.wikipedia.org/wiki/Quicksort" rel="nofollow noreferrer">quicksort</a> or <a href="http://en.wikipedia.org/wiki/Merge_sort" rel="nofollow noreferrer">mergesort</a>.  </p>\n\n<p>Both are O(nlogn) as opposed to bubble sort\'s O(n^2)</p>\n'}, {'answer_id': 78122, 'author': 'Patrick Desjardins', 'author_id': 13913, 'author_profile': 'https://Stackoverflow.com/users/13913', 'pm_score': 0, 'selected': False, 'text': '<p>In C#, List has .Sort().</p>\n\n<p>In general QuickSort is very fast on many situations but it always depend of the size of the array,</p>\n\n<p>Here is the <a href="http://en.wikipedia.org/wiki/Quicksort" rel="nofollow noreferrer">link</a></p>\n'}, {'answer_id': 78132, 'author': 'Community', 'author_id': -1, 'author_profile': 'https://Stackoverflow.com/users/-1', 'pm_score': 1, 'selected': False, 'text': '<p>The answer to your question is intimately related to some details you haven\'t provided. The "best/fastest" way depends on how long the fields are, how many you have to sort, how much memory you have available, the relative speeds of disk and memory, the details of what\'s in the strings, ..., <em>ad nauseam</em>.</p>\n\n<p>Knuth Vol 3 has the details on a wide variety of approaches.  I don\'t recall if he discusses Radix Sorting, but he probably does.  If he doesn\'t, you should look up some references on Radix Sorting.  It\'s only useful in a narrow set of circumstances, but positively flies there.  If you\'ve got a small set of short strings, Bubble Sort will perform better than complex sorts on some architectures, due to lower overhead.  The C Run Time Library includes a version of Quick Sort because that can be a very efficient algorithm for larger data sets in some circumstances.</p>\n\n<p>Net-net, the answer is "It depends".</p>\n'}, {'answer_id': 78133, 'author': 'Aaron', 'author_id': 14153, 'author_profile': 'https://Stackoverflow.com/users/14153', 'pm_score': 1, 'selected': False, 'text': '<p>The "best" way depends on a lot of factors:</p>\n\n<ol>\n<li>Do you need to support more than language?</li>\n<li>Do you need to support more than one language simultaniously?</li>\n<li>Do you need to support languages other than the current Operating System or user language?  (ex, web applications)</li>\n<li>Do you need to support more than one encoding? (unicode, utf-16le/utf-8, ansi code pages, etc)</li>\n<li>Do you need to support long or highly redundant inputs? (where precomputation or compression may speed up sorting operations)</li>\n<li>Do you need to support a large number of inputs, ex: million, or billion inputs? </li>\n</ol>\n'}]
['https://Stackoverflow.com/questions/78077', 'https://Stackoverflow.com', 'https://Stackoverflow.com/users/14239/']