I agree with B. So I think that if there's a language programmers usually write when they program for your profession, learn that language. Too often beginning programmers learn a programming language because it's popular or the most popular one they know of. They ignore whether it's the best one for the problems they need to solve. If I wanted to write, say, a natural language interface, I'd write it in Prolog because its designers invented it for natural language processing.
Oh yeah? Dem's fighin' words. Let's see ya do dis in C++. In (http://www.haskell.org/haskellwiki/Why_Haskell_matters#Elegance).Nu uh! C++ is the best language out there and solves everything and is what WoW is written in!!!
The Haskell quicksort program is about 23 lines shorter than the C++ template for the same algorithm. The Haskell program will sort any sortable data, but you don't need to declare their type.
Oh yeah? Dem's fighin' words. Let's see ya do dis in C++. In (http://www.haskell.org/haskellwiki/Why_Haskell_matters#Elegance).
Speaking of Dem's, I'm a very paleoconservative member of the Constitution Party.
I'm happy to hear that I did not disappoint, my friend. I always love to promote my favorite programming language.
qsort [] = []
qsort(x:xs) = (filter < x xs) ++ [x] ++(filter >= xs)Thanks, Cromulent. I do like Erlang, I wanted to install an Erlang compiler on my iMac, too, but I thought no one wrote one for it. I think there are Windows, Unix, and and Linux, compilers for it. I seem to remember that I ran one on my Solaris box before that machine decided to hide under my bed.
Ooh, I miss the big, old guy.Thanks, jimianus. I'll look into it. Earlier this morning, the "make" command ended abnormally because some program didn't have permission to do something or other. Since I'm a Solaris guy, I'm used to running the "su" command instead of "sudo." Maybe, if I run make with sudo, the program I'll get an Erlang compiler, even without downloading anything from Macports.
Thanks, Cromulent. I do like Erlang, I wanted to install an Erlang compiler on my iMac, too, but I thought no one wrote one for it. I think there are Windows, Unix, and Linux, and Unix compilers for it. I seem to remember that I ran one on my Solaris box before that machine decided to hide under my bed.
./configure --enable-threads --enable-smp-support --enable-kernel-poll --enable-sctp --enable-hipe --enable-native-libs --enable-shared-zlib --enable-darwin-64bit --with-ssl --with-javac --with-termcap --enable-dynamic-ssl-libmakesudo make installO noes!! Teh Haskell fans comparing crappy algorithms written in crappy style in another language. Why don't you use stl's partition? Why are you allocating new arrays? Why are you using arrays instead of iterators?Oh yeah? Dem's fighin' words. Let's see ya do dis in C++. In (http://www.haskell.org/haskellwiki/Why_Haskell_matters#Elegance).
#include <algorithm>
template<class Iterator>
void sort(Iterator first, Iterator last) {
if (first == last) return;
Iterator middle = partition(first, last, [=](decltype(*first) a) {
a < *first;
});
sort(first, middle);
sort(middle, last);
}I think you may be blurring the difference between a "crappy" algorithm and a poorly written program that uses it. If the quicksort algorithm is "crappy," why does your program at least seem to use it when it tells your computer how to partition the list it the list the machine sorts? Quicksort works poorly when the list is already or nearly in order. But I think n log n time complexity is quite good. If there's a faster sorting algorithm, why does C's collection of standard functions include a quicksort function rather than, say, a heapsort function or a merge sort function?