Below is my .h file and the code below that is my function that I'm having troubles with. Its suppose to take in a users topic and see if that topic exists, if it does exist then find the keyword, commentcompare will find where that keyword is and delete the comment. However its not deleting anything and its returning temp is NULL.
class comment //adds a comment
{
public:
comment(char * create_comment);
I am working on creating a program using HashTables. This is for homework. This is the first time I am using and creating HashTables, so forgive me in advance as to I don't know entirely what I am doing. The main problem I am having right now is incorporating my remove() function. I can get the code to compile, but when I run test the program out, it crashes. The error that I am receiving is list iterator is not decrementable Here is my hashtable class as well as my remove() function. Also need to incorporate a print method.
#include<iostream.h> #include<conio.h> int main() { setcolor(BLUE); setbkcolor(yellow); cout<<"the text in blue colour with yelow background"; getch(); return 0; }
it keeps returning the same error always in my turbo c++ compiler . What is the correct program for changing background colour and text colour ...
Im working on a BST remove function. I think I'm on the right track but I'm not sure. From what I understand there are 3 possible cases. A Node with no children, one child, or 2 children(this being the most complex).
for(c=0;c<100;c++) { m = c % 10; printf("%d ",m); } return(0); }
When I run this code in my compiler, I get the first nine or ten numbers, and then after that it just spells out the letters in my name in different sequences over and over.
I have two functions bool check_key(string cKey, string eKey) and bool check_digit(char digit1, char digit2), and I have declared both of them globally (is this the right terminology?) right after the "using namespace std;" and right before the "int main(){".
In the first one, I called the second one . But it is giving me the error: "no match for call to `(std::string) (int&)' ".
the functions checks if the word is a palindrome like"level" "madam" etc. but with input "dfdfdfdffdfd" my recursive function fails.
Code:
/* main.c - Created on: Nov 9, 2013 - Author: Kaj P. Madsen*/ #define MAX 100 #include <string.h> #include <stdio.h> int checkPalindrome(char checkString[MAX]); int checkRecPalindrome(char checkString[MAX], int strLgt, int a); }
[code]....
results from "dfdfdfdffdfd" added some print to see that its the variables a and strLgt not functioning properly
Code:
dfdfdfdffdfd. The word is not a palindrome(iterative) strLgt: 11 a: 0 a: d strLgt: dstrLgt: 10 a: 1 a: f strLgt: fstrLgt: 9 a: 2 a: d strLgt: dstrLgt: 8 a: 3 a: f strLgt: fstrLgt: 7 a: 4
it produces a correct number when called, but it is not a rounded number, the roundf((float)cel) does nothing. I get the same number with and without it.
The function Reverse does seem to work. Its supposed to take the words in a sentence and then reverse them. For example: "This is nice" to "Nice is this." When I type "This is nice" I get " niceniceis nice"
#include <iostream> #include <string> using namespace std;
i think my function call is not working and i dont know how to fix it. Basically i want it to output my getstudent function and once i get the information i want it to output with the displaystudent.
making my delete function work. My program does compile but my delete function doesn't work. I haven't finished my last two functions because I am focusing on the delete but how to Sell a title and print the value of all sold titles would be nice as well.
I am writing a program where f is the frequency and the x has the values as well. Now I am calculating the mean which is summation fx divided by summation f. I have the two functions working correctly but the getmean function is not working. It suppose to divide fx/f . check the code below
#include <iostream> using namespace std; const int SIZE=5; class statisticalOperator{
I tested my count funtion. So my count function is not working properly, it should return 5 because 5 words have prefix "tal," but it is giving me 10. It's counting blank nodes.
This is my main.cpp file
int main() { string word; cout<<"Enter a word"<<endl; cin >> word; string filename;
I've created a function where you can choose any bounds for an array based list (positive or negative, as long as the first position is smaller than the last position). However for some reason when I call the print() function in my application program it doesn't do anything. My print function is technically correct (I still have work to do on the output) but I can't figure out why it wont show anything at all. Below is my header, implementation, and main program files, along with results from running the program.
Code: /* generals is the first array. Max 10 elements. numGenerals is the element count of generals.
genBuff is the second array; it is to be checked/pruned. genCount is the element count of genBuff. genBuff will be a max of 171, but be pruned to no more than 10, and no more than the complement of the element count of generals. */
[Code] ....
(I do have comments in the actual source, different from above).
I have two int arrays. They hold values from 0 to 170. The first one will never be more than 10. The second will be at most 171, but will be whittled down to at most 10, usually less. 171 is worst case, most users of this particular program will probably be reasonable and not try to add all 171 (max is 10 anyway). The first array is the original array. The second array is a temporary array. Any value in the second array that is also found in the first array, is removed from the second array, since all values in the first one must be unique. After this pruning process, both arrays will collectively contain no more than 10 unique elements; the elements from the second will be added to the first.
So right now I have three nested loops. I figured with the miniscule array sizes it wouldn't be a big deal. I can think of a way to remove one or two of them, but I want to be sure that I'm still writing clean, legible, good-practice code. The first loop walks through the first array. For each element in the first array, there is a second loop to walk through the second array to check for duplicates. If a duplicate is found, the third loop walks through the second array to overwrite the duplicate while preserving the second loop's position (j).
Is this dumb? I know that the big O gets worse and worse the deeper you go with nested loops. Even though the arrays are really tiny, is this still a thing to avoid?
The following 2 codes are almost identical, only that the switch statements are slightly different. The 2nd code has the issue of requiring an additional enter key to be pressed when I enter '3' as input to exit the program.
Working code :
Code:
#include <stdio.h> #include <ctype.h> #include <string.h> void clearKeyboardBuffer() { int ch; while ((ch = getchar() != '
I know how to remove digits in number from right to left.For example: the number 319. If I do (number /= 10), I get 31.how can I remove digits in number from left to right.For example: the number 319. If I will do something, I will get the number 19.
class List; List *deletezeroendlist(List* L); class List { public: intdigit; List*nextDigit; public: List():digit(0), nextDigit(NULL){} List(int d, List *next):digit(d), nextDigit(next){}
I have tried many different ways but it is still not the answer / perform the function List *deletezeroendlist(List* L)