.
Everything your computer does is a mathatical algothrim after all, all it does is work in numbers at base 2.and back in the real world, not everything amounts to mathematical equations. I need software to represent my real world objects, not equations. My real world objects have behaviours that are represented by statements (methods etc.)
Talking of basic stuff, you should learn how to spell algorithm.
Quite, but I don't need to know the somewhat complex algorithms needed to add my delivery to a container, and have it assigned to a van which will be given a delivery address, do I? I just need to know my Delivery object, is contained in a Container object, which in turn is assigned to and contained within a Van object, which has an Address to deliver to.
Again, anothyer person who can't spell algorithm. WTF.
Or just common sense, once you have got your head around normal forms (the important ones being short Wikipedia articles, at most). You do not need relational theory to know how to design good databases, good grief. This is why Relational Database Management Systems (RDMS) like MySQL exist.
Here is a good quote I've picked up: "We're better than you at software. You probably went to college at some crap and ****ify your algorithms all over whiteboards, doing stuff and repeating patterns that we just know in our heads as "how it works"".
Haskell is an academic language and an academic project. It isn't properly used or regarded in the real world.
My spell checker isn't working, but you welcome to check my posts for me if you like?
Typical. I can tell you have a professional atitude.
You saw past the sarcasm. (FYI, you can't share links to searches. Doesn't work.)
Depends quick sort in haskell
qsort [] = [] //Redudent line, used for defining quick sort for empty lists, it just returns the array back again
qsort (x:xs) = qsort (filter (< x) xs) ++ [x] ++ qsort (filter (>= x) xs)void qsort(int a[], int lo, int hi) {
{
int h, l, p, t;
if (lo < hi) {
l = lo;
h = hi;
p = a[hi];
do {
while ((l < h) && (a[l] <= p))
l = l+1;
while ((h > l) && (a[h] >= p))
h = h-1;
if (l < h) {
t = a[l];
a[l] = a[h];
a[h] = t;
}
} while (l < h);
t = a[l];
a[l] = a[hi];
a[hi] = t;
qsort( a, lo, l-1 );
qsort( a, l+1, hi );
}
}