>>39 so it loops through the whole path. WOW! its almost as if there was a way of parsing http requests without looking at every byte!
Name:
Anonymous2015-07-14 22:26
>>42 well done seeing through the bs, you need at least O(N^2) for a DOS, this is only O(N)
Name:
Anonymous2015-07-14 23:50
>>43 What the fuck does time complexity have to do with running it on DOS?
Name:
Anonymous2015-07-15 1:09
>>44 If you have too many disks you'll run out of letters, hence disk complexity is of up most importance. However time complexity is irrelevant.
Name:
Anonymous2015-07-15 14:35
Why don't you follow Cudder's task to write a browser in ASM? You could use FASM since you like it so much. Much of the design implementation is out there on all the browsers' threads. Let me know, I want to help!