No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
13 Posted Topics
Re: Post the code your trying to compile, the last couple lines in your last post look to be issues with your code | |
So what I am trying to do is to have a header file which declares lists in it. Everytime I complie it, it does not know what a list is. Here is my header file called MergeSort.h [code] #include<list> class MergeSort{ public: MergeSort(); bool sortedIsEmpty(); int sortedGetLenght(); bool sortedInsert(int); bool … | |
Here is my code: [CODE] /** * @file qsort.cpp * * @date 11/2/07 * * This program implements the non recursive version of quicksort */ #include<iostream> using namespace std; /** * Swaps two items * * @pre x and y are the items being swapped * @post Contents of actual … | |
Here is my code: [CODE] #include "Poly.h" int main(){ Poly p; int degree = p.degree(); cout << degree << endl; int coefficient = p.coefficient(5); return 0; } [/CODE] [CODE] #include<iostream> using namespace std; class Poly{ public: Poly(); //constructor int degree(); //Returns the degree of the polynomial int coefficient(int); //Returns the … | |
I need to use recursion to find the largest int in an array. What I have so far is [code] #include <iostream> using std::cout; using std::endl; int maxArray(int anArray[], int size); /** *The main method * *@param myArray[] The array we are searching * *@param sizeOfArray The size of the … | |
[ICODE] /* * Global Tech's employee system */ #include<iostream> using std::cout; using std::cin; using std::endl; #include "Person.h" int main(){ Person employee("Sue" , "Jones"); cout << "Employee Info " << employee.getFirstName() << " " << employee.getLastName() << endl; return 0; } /* * Person Class Definition */ #include <string> using std::string; … | |
Here is the code I have [ICODE] #include<iostream> using namespace std; void push_t(int j) //--------------------------------------------------- // Accepts a value and pushes it onto the stack top // Precondition: if keyset = 0 the deque does not yet exits // deque is a structure with int j for data // Postcondition: … | |
I am having trouble figuring out how to get my non recursive quicksort program to finish sorting. Here is my code [code] #include<iostream> using namespace std; /** * Swaps two items * * @pre x and y are the items being swapped * @post Contents of actual locations that x … | |
I am getting a Segmentation fault when I run my code. It is happening right now when the 100,000th array location is being populated. But it has been at different spots when I ran it before. Any ideas?? [code] /** * @author Jason Mejak * * This program uses the … | |
I am very confused with ADT. I get the concept of why to use ADT, but I dont know how to implement it. The problem I have to solve is to merge 2 sorted list using ADT functions provided. The ADT functions are the functions in my header file. Here … | |
I have this program I have to write about adding binary numbers. Here is the write up: "Defining a binary number as int binNum[8]; write a C++ function void binaryAdd(int* sum, int& cBit, const int* bin1, const int* bin2) to compute sum as the sum of the two binary numbers, … | |
Re: Can you elaborate a little more on what you need? | |
Re: [quote=cms271828;265196]I just installed IntelliJ Idea, and it looks great, seems to do a bit more for you than netbeans does. IDE's are like pens, you have to find one that you are comfortable with, I will probably move onto IntelliJ Idea in the future, but its not free software like … |
The End.