I am trying to get this problem worked out but still not able get it right.

0000 4900FE ;Get input from the user and store it @ 00FE
0003 4900FF ;Get input from the user and store it @ 00FF ...

Did anyone ever figure out why this did not work?

I am having trouble trying to get this machine language program to work with pep/8. Write a machine language program to input two one-digit numbers from the user, add them, and output the one-digit...

Having trouble understanding O-notation. This is the question:

10. The approximate number of iterations of an algorithm with data size N is determined to be: 1 + 2 + 3 + ... + N
a. Write a table...

Thanks Narue you helped me a bunch.

I have an assignment dealing with algorithms and Big O notation. I am a little confusded about this notation stuff. Here are a few of the questions on the assignment:

What is the O-notation for...

I have just started to learn about stacks and have been scouring the net for information. I am having trouble coming up with an answer for this question:

Suppose you were asked to add a function...

I am having trouble trying to implement my recursive method for inserting into a linked list. I made the recursive method private because it needs acces to the head pointer. Not sure where to go from...

THe problem requires you to solve it recursively. I ended up solving the problem. Here is the code:

bool count(int x)
{
if(x==42)
return true;
if (x<42)
return false;
if(x%3==0...

Having trouble where to go next on this program:

1. If n is even, then you may give back exactly n/2 bears.
2. If n is divisible by 3 or 4, then you may multiply the last two...

Thanks both of you for your reply.

I am having a problem with a recursion problem. I have been reading alot of threads on this subject here and other places. I think I understand what recursion is. I am just having a problem trying to...

I have been working on this program awhile and I am almost done with it except for trying to get the output to look like what instructor wants. Here how the output should look:

BREAKING DOWN: list...

Almost got this program to work. Still have one error but not sure how to fix.
It is using a linked list class for storing nodes. Here is the code:

// functions use by main
void...

Can someone point me in the right direction on implementing a merge sort.
Here is what the main program will look like. THanks.

int main(void)
{
int ar[100];

int i, v, len;

...

Thanks for the reply I finally got it to work. Now th problem I am having is tring to remove a node with two children. Any suggestions.

I have a root node.Here is the entire code:

#include <iostream>
#include <cstdlib>
#include <string>

using namespace std;

class node
{

I am having trouble coming up with code for removing a node in a binary search tree. This is what I have so far:

void remove(int n)
{
node *current=root;
node *gptr;
...

Sorry for the mix-up but i finally figured the darn thing out. Thanks any way.

I am having a very hard time trying to solve this problem.Here are the instructions to the assignment:

Implement a Priority Queue using a heap.

The heap should be implemented as a class that...