Elysian Shadows

sorry if this is not suppose to be posted here. i wrote this to JForce on youtube. "i did watch ep8. there is no way you are just going to pick up XNA, and suddenly make the best indy game. im sorry its just not gonna happen. if you had said this 15 years ago, when gaming was in its infancy, y...

ansatsusha_gouki wrote:i hate pointers......still dont understand the concept for it

just hang on. im gonna get to the point where you will see.

1.8 - generic and null pointers this is where things start to become a little more fun. conisider an application where you want to be a reference to "any" kind of object. people that are familiar with java know about this. the Object type. in C there is a special type of pointer called voi...

1.7 - qualified pointers a const qualifier applied to a pointer can mean on of three things: const int *p; . pointer to a constant integer, the value if p may change, but the value of *p cannot. int *const p; constant pointer to integer; the value of *p can change. but the value of p cannot. const i...

i started a thread "Pointers and their Application"
please let me know if anyone will use this.
dont wanna make it if there is no interest.

1.6 - pointer assignments okay, some information that might help when you get compile time errors. have you ever ran into a error at compile time and the error is something like left-hand value bla bla bla.. pointer assignments are the same as any other, they have to be correct at compile and run ti...

"self sorting" thats a property of a binary tree. it sorts as you add nodes. Ha, true. and im not sure why you said "smart pointers" this is what smart pointers are. You're obviously not storing 'data' as I envisioned you would be. With the given code, how would you implement th...

i'll list 15 books i would recommend getting over time. these are by far my favorites and i own a hard copy of each. not necessarily in this order. i'll list the CS books first then moving on to math. 1. "Core Techniques and Algorithms in Game Programming" http://ecx.images-amazon.com/imag...

Now make it completely self-sorting and sufficient using smart-pointers and templates--naw, heckling ya. ;P I'll take a look at it when I've got more time. I've never seen the 'formal way' (if one exists) to implement one. I've read up on the theory, and everyone I've used I created my own algorith...

here is a C++ implementation of a binary tree. binary trees are very powerful tools. #include <iostream> using namespace std; typedef struct node { int val; node *rNode; node *lNode; } node; class bTree { public: bTree(); node *add_Node(node *tRoot, int data); void print_Tree(node *tree); node *root...

your code does not work, it produces 2 carries for the numbers 1901 and 99, it should be 3. Oops, you're right. I've quickly made a simple one that uses an actual carry flag :D public static int numberCarries(int p, int q, int carry) { if ((p + q) + carry < 10) return 0; else return ( ((p % 10) + (...

This is a pretty interesting, and fun idea. My question is this: will processing time be taken into account for the winner? I think I've got a method to overcome running out of space in RAM, but it'll probably be reallly slow. ;P dont worry about speed. its just about size my number does not count,...

i'll post some hints. some things i used. i used mod, with base 10. "num%10= remainer" - this is how you isolate the last digit in the number like 1234%10=4 i have 2 if statements. and i use recursion. armed with that you should probably come to the same function as me. its only about 6-7...

jeez, i must be more nerdy than i thought. Heh, don't worry about it. Here's a simple Java class that solves the problem: public class Addition { public static void main(String[] args) { java.util.Scanner input = new java.util.Scanner(System.in); System.out.print("Enter first number: "); ...

i'll post some hints. some things i used. i used mod, with base 10. "num%10= remainer" - this is how you isolate the last digit in the number like 1234%10=4 i have 2 if statements. and i use recursion. armed with that you should probably come to the same function as me. its only about 6-7 ...