wykurz

Hi Problem is, i can't log into my ftp ( neither of this worked): ftp.wykurz.astahost.com.com ftp.wykurz.astahost.com user: wykurz (cannot find computer or computer name - gFTP) ftp.astahost.com.com user: wykurz (my passwd didn't work) Also I can't log into my cpanel: http://forums.xisto.com/no_longer_exists/ http://forums.xisto.com/no_longer_exists/ Other: When registering my domain name (wykurz.Astahost.com) i hoped it would be a subdomain of Xisto.com, but the registration form told me, it isn't. I checked spelling and continued anyway, hoping everything will be ok. Well, it isn't. Someinfo: Please help! Regards

two years ago i have discoverred function programming. i'd like to shortly discuss it here and, maby, encourage some of you to try your skills writing functions. when programming imperatively, programmers often think of solving the problem in language categories. here i'd use an array, here i could use a pointer etc. funtion programming does not give programmer such tools. even more - thers is no such thing as variable. function programming was invented by mathematicians. it's very simmilar to mathematical modelling of universe. solving a problem - writing an algorithm, is to define some absrtact form from simple (mathematical) objects, like numbers, sets, functions. to show you some great abilities function programming gives the programmer it's good to think about everything as a function. even integers are functions! (please refer to Church numbers). now you can mix everything with everything and what you get might be also anything. function operating on funtions giving in result a function is common. in my opinion, what's most cool when programming functions, is that code you create is clear and easy to understand. it makes debugging very simple. although solving a problem with functions might take a bit more time than imperatively. but you don't spend time on debugging. For instance it took me just an hour to write from a scrach AVL trees and test them. In C or C++ it would take at least twice that time. if i interested you just a bit please refer to: http://caml.inria.fr/ http://homepages.inf.ed.ac.uk/wadler/guide.html

for some time i've been looking for some algorythmic contests. i'm a student, so i can take part in mostly all of them, like the most famous ACM. but i don't really have a team yet (so it'll have to wait ). i'm working on the topcoder contest at the moment, but it's not quite an algorythmic contest... (anyway, those algorythms mostly aren't really hard to guess, it's more about the time you need to write them).there's also data mining cup, which is more about data mining algorithms.i'd appreciate some hints on where to look for some challenge. do you know any good contests, any competitions etc. ? if so, please write here.

i think that in most cases the best choice is to use common library algorithms, like C++ quicksort. it's a very smart modification of insertion sort (much better than bubble sort, because it leaves the same element's in order they were in the beginning) and original quicksort. takes one line to write it. if you don't want to use libraries, you can easily write insertion sort. works pretty fast with lists up to 50 elements (if larger think about QS).if sorting integers from a certain range you can use algorithm that would work in O(n) (easy to guess how it works, i hope )if you're just interested in theoretical algorythmic aspect of how fast can i sort a list of X elements (where X is constant), than it's quite easy to think out how can you do it with list of up to 6 elements. for a list of 24 elements it took 3 weeks to compute the result with 3 PCs (pentium III 1GHz). regards