ictos

Members
  • Content Count

    75
  • Last visited

Community Reputation

0 Neutral

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

  1. Does it actually pay? Not hearing anything good about this site: https://www.trustpilot.com/review/cpuwin.com https://www.scambitcoin.com/cpucap/
  2. Worth taking a look at these: https://www.scambitcoin.com/btcpool-io-review/ https://www.scambitcoin.com/btconline-io-review/
  3. 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.
  4. 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.