pandaEater

Big-O of 2^(100n) I'm having some trouble figuring this one out. Basically I'm wondering if the constant multiple c is a multiple of n or a multiple of the whole function? For example, if it were O(2^n) would you put the constant multiple next to n so it could be: …

I'm new to AJAX, PHP, and Javascript and I'm trying to learn more about them by setting up a user login for a website. I've gotten it working but there are a few problems I'm having trouble solving. Right now the login works, but I'd like to check if the …

I'm having some difficulty figuring out how to delete the objects I new'ed during run-time. I'm using a heterogeneous collection. Simplified Example: [CODE] const int SIZE = 4; myBase* objs[SIZE]; objs[0] = new myChild1(); objs[1] = new myChild2(); objs[2] = new myChild3(); objs[3] = new myBase(); //I tried: for(int i …

How do you pass an unknown object into a function and save it? I'm trying to have a set and get function in a class I'm creating that can hold and return any object. Here are my attempts so far: [CODE] void* holder; void setHolder(void* object) { holder = object; …

Is there a way to disallow access to a Parent function in the Child class? For example, the Parent class has a function, myFunc(). In main() after I instantiate a new Child object I don't want myFunc() to even be an option. So child.myFunc() would cause a compilation error.

I'm new to C# and I'm having some trouble getting input from a file and using it properly. I need to get input from a file and insert the values given into a function but the problem is I need to give the functions parameters that aren't strings. TimePiece is …

I'm making a heap class and I want one of my functions, [I]const Employee& Heap::top() const[/I], to return a reference to the top element or throw an error if the heap is empty. I've never used try, catch, or throw statements before so I'm having trouble getting it to work …

I'm making a hash table using a linked lists to handle collision. So I'm creating an array of "head" pointers to access each linked list. I can't figure out why I'm getting the error below: error C2440: 'initializing' : cannot convert from 'LinkHash::ListNode' to 'LinkHash::ListNode *' I commented **not working** …

I'm trying to make a binary search tree without using recursion anywhere. I'm having trouble with the destructor though. I've been thinking about using a stack to help me keep track of the nodes but I'm not sure exactly how I would implement that. Any ideas? Relevant code: [CODE] class …

I've been working on getting the Big-Oh notation for this code segment a couple days now and I can't figure it out. I've most likely come across the right answer but I can't convince myself it's right. What's the Big-Oh notation for the following code and how do you arrive …