By mswatcher
via solarianprogrammer.com
Submitted: Feb 04 2013 / 10:17
For many programmers sorting data in parallel means implementing a state of the art algorithm in their preferred programming language. However, most programming languages have a good serial sorting function in their standard library. It appears to me, that the obvious thing to do is to first try to use what your language library provides. If this approach is not successful, you should try to find an existing library that is used, and consequently well debugged, by other programmers. Only as a last resort, you should implement a new sorting algorithm from scratch.
-
How to connect Android with PHP | Android Aspect
-
Understanding XAMARIN – Create iOS, Android, Mac and Windows apps in C#
-
What I wish systems researchers would work on
-
Programming The Feynman Way
-
Dojo FAQ: Is there a way to extend a widget's template (e.g. Dialog)?
-
Hibernate 4 Entity Persistence States
Add your comment
