Search:

Take a look here, it migh help you a bit..

http://www.nist.gov/dads/HTML/stringMatching.html

Simple extension of provided algorithm will solve your problem in additional O(n*n), but i'm pretty...

Yep, quite correct, but from geographical pov...okay, quiz over, it's Corsica island :o)

Because it's somehow related to my maybe-one-day game engine :o)

No. No lollipop ;)

Hey boys and girls!
first one who guesses (correctly :)!) what's on the image gets... ehh... lollipop?.. ok gets nothing but is certainly good in geography!

Nice job, Prelude :)

You could create bit higher-level hierarchy of objects in scene (ships, asteroids, whatever else you want to have there) and use appropiate lists there.. most basic would be using two classes of...

Check your compiler's documentation - there usually is a switch or choice specifying what exactly do you want it to output - executable, lib, dll, whatever, depending on platform and other things.
...

hmm, i can send you some "template code" if you want :).. i left SetPixel() and similar functions next day i met them ;)

No, so far, i haven't been doing any opts (even compiler opts are completely disabled), though some assembly coding might speed the whole thing a bit..

BTW i already have benchmark built in :D

Quite mess in terms, i guess... the sort i meant is commonly known as heap sort, binarity in it is hidden under binary heap it utilizes.
Radix sort and counting sort belong to quite different class...

Hell, yeah :D . So far, i can do from 5 to 25 fps in 160*120 rendering resolution (on PIII@800), depending on complexity of the scene. That shot posted up there was taken in 320*240, with fps...

I'm afraid you won't find too many voxel tutorials other than closely related to landscaping, because term 'voxel' is used in context of landscape engines much more often than in any other situation,...

If you want to pass filename to load() function, you need to pass char *, not just char. So far, you are only passing first char of argv[1]. Use

void load(int argc, char *filename)

In your...

Well i guess we do quite different things ;)

But anyway, i'm eager to see more works like these here :)

It uses DirectX 8 for displaying purposes, otherwise it is all mine :)

I replied to 'binary sort' as an approach, not to tree data structures.

No, just small reminder of it :)

If we are chatting about the same method, then you do not need to create anything, just need good old array... that nlogn sentence is fully correct, but it's quite matter of discussion which method...

Hey, Athens' over :( ...so at least small reminder of Acropolis :cool:

>There's a binary tree sort, but it's not worth the effort...
Well i must disagree, it IS worth the effort if you sort 'bit' more then dozens of items. But there is possibly a cheaper alternative:...

Header file declares things - it says compiler that things you use in code (functions, defined names etc.) do exist, that they are defined, somewhere. Then, compiler can say your code is...

well, besides other things, you are counting words via spaces, so if user enters "standard" sentence with just one space between words and no spaces leading/trailing, you need to count spaces + 1 :)

If you create custom class/windowproc/whatever for scrollbars with features you want it to have, you can work with it the same way as with std. scrollbars and without any overhead work, no ;p?...:)?

Use standard depth-first search approach:
(pseudo)

dummy_dfs(current)
if (current->level == 8)
  if (min > count)
   min = count;
   minstruct_id =...