ictos

nice find, very rare!

Very nice & artsy, just what I like!

THanks lets have a butchers

Good work, what's inside?

NIce site, what's in the bag?

Excellent site!

Thnak you!

Looks interesting thanks!

Thanks good work!

Thanks 4 nikki!

Thank you!

Looks nice thanks!

Thanks wotcha got?

Good stuff thanks!

Thanks lets see!

Thank you!

Thnaks 4 onlyfans!

Thanks nice work!

The best way to look at recursion is as an alternative to iteration. Take the string: char szHello="Hello World"; Let's say you're implementing a simple print function that calls putc(char c) to display each character. Normally, you'd do it like: for(i=0;szHello[i]!=0;i++) putc(szHello[i]); but let's say you wanted to do it recursively (you wouldn't, but this is an example): void print(char *szString) { if (*szString) { putc(*szString); print(szString + 1); } } The risk with recursion over iteration is that you could run out of stack space. So, why would you use it? Well, say you had a data structure: struct tree { struct tree *pLeft; struct tree *pRight; char bLetter; }; Now your print function would be: void print (struct tree * pTree) { if (pTree->pLeft) print(pTree->pLeft); putc(pTree->bLetter); if(pTree->pRight) print(pTree->pRight); } Note that I'm assuming you're familiar with pointers.

Thanks good stuff!

THnaks, what's in the bag?

nice find thanks!

Sounds fun thanks!

Ah, but which assembly language? If you're using a PC, you're talking x86 assembly but if you're using something like a Raspberry Pi, it's going to be ARM assembly.

Nice site, thanks!