nhrnjic6

Am trying to build a function that will take string, sub_string that will be replaced, and new string that will replace that sub_string. Now before you all go with strstr, i dont want to use <string>. Anyway I got my code working to find a index of a char array …

how to write definition head for a template function that returns enum. I got a template funciton List<List_entry>::print_List(){code..} but I dont get how to return an enum. My current head is : template<class List_entry> List<List_entry>::Error_code List<List_entry>::put(const List_entry &x){code..} but it errors me that I need 'typename' before 'List<List_entry>::Error_code' because 'List<List_entry>' …

Am having real problem understanding what the problem is. Here is the code : Stack.h : #ifndef STACK_H #define STACK_H #include<Node.h> typedef int Stack_entry; class Stack { public: enum Error_code{succes,overflow,underflow}; private: int counter; public: Stack(); ~Stack(); //Stack& operator=(const Stack &Stack_copy); bool empty_stack()const; Error_code push(const Stack_entry &item); Error_code pop(); Error_code top(Stack_entry …

So I've built a Queue data sructure(all the needed methods) and I just wanted to know how can I use my Queue objects in different project ?

Is it possible to stop the lets say for loop with a function : for(int i = 0;i<15;i++){ cin >> input; obj.add(input); } // and then have some add or some other function that checks if (x == max_size) check(){ if(counter == max_size) stop the foor loop and continue.. }

OK. I just don't understand what is the problem here. Here's the code .h file : #ifndef NVECTOR_H #define NVECTOR_H class Nvector { public: //Nvector(); Nvector(int Size = 0); void addElement(int a, int index); void getElement(int index); void push_me_back(int a); void push_me_front(int a); private: int *p_array; int velicina; int *resize_array(int …

Ok, I hope this is the right place for his kind of disccusion. I assume that this kind of question is rather apsurd but I may get killed for this. I have had expirience with both java and c++ but non in field of system programming. I am finishing my …

I have hard time understanding how does it happen. I mean how does : 6 / \ 3 8 / 2 I get that program finds the num on the left side whos equal to null so its smallest and it prints out 2. But how does it go back …

This is the function : node* remove (node* p_tree, int key) { if ( p_tree == NULL ) { return NULL; } if ( p_tree->key_value == key ) { // the first two cases handle having zero or one child node if ( p_tree->p_left == NULL ) { node* p_right_subtree …

In function : node* insert_in_tree(int number,node* p_tree) { if(p_tree == 0) { node* newNode = new node; newNode->num = number; newNode->p_left = 0; newNode->p_right = 0; return newNode; } if(number < p_tree->num) { p_tree->p_left = insert_in_tree(number,p_tree->p_left); } else { p_tree->p_right = insert_in_tree(number,p_tree->p_right); } return p_tree; // refering to this } …

I get the algorithm and how binary trees should work but this I don't get : look at the basic binary tree insert function : node* insert_in_tree(int number,node* p_tree) { if(p_tree == 0) { node* newNode = new node; node->num = number; node->p_left = 0; node->p_right = 0; return newNode; …

func should take array and find a index of a target number : int find_index(int num,int Niz[],int index){ if(num == Niz[index]) return index; else if(num != Niz[index]){ find_index(num,Niz,index++); } else {return -1;} } I quess I know am accesing unacesable memory, just cant figure out where

program works fine until I call print_List function : void print_List() { Vagon *kondukter = head; while(kondukter != 0) { cout << kondukter->num<<" "; kondukter = kondukter->p_next_num; } cout << kondukter->num<<" "; } and that it opens some some new boxs that says : win checking for solutions. I used …

How do I add second element ? right now it works and I get output of 13, but lets say I want list of 2 elements, how do I do that ? here's my code : #include <iostream> using namespace std; struct Vagon{ int num; Vagon *p_next_num; }; int main() …

so if I have const int SIZE = 4; and a while loop const int SIZE = 4; int counter = 0; while(true) { // do something ... if(SIZE == counter+1) {cout << "Hello world"} } why is this not working? and how is the right way to do it?

so if I have const int SIZE = 4; and a while loop const int SIZE = 4; int counter = 0; while(true) { // do something ... if(SIZE == counter+1) {cout << "Hello world"} } why is this not working? and how is the right way to do it?

Can somebody please tell me what is wrong in here or what does this error message means : " error : reguest for member 'name' in 'person',which is of non-class type 'Person[2]' " struct Person{ int days; string name; }; const int size = 2; bool way_to_Sort(const Person &a, const …

Let me try to explain a problem I have.I have built array of structures that contains int(num of days) and string(Name).So basicy user should enter name of a friend and days they last talked,and then make a list sorted by the names of the friends of by how recently it …

void John_is_3D(int dimx,int dimy,int dimz) { int ***John; // pointer to pointer to pointer John = new int**[dimx]; // array of pointers to pointers for(int x = 0;x<dimx;x++) { John[x] = new int*[dimy]; for(int y = 0;y<dimy;dimz++) { John[x][y] = new int[dimz]; for(int z = 0;z<dimz;z++) { John[x][y][z]= x*y*z; cout …

I have a practise problem to write a function that takes 3 dim and dynamicly allocates 3d array with those values and then (PART THAT I DONT GET) : fills the 3-dimensional array with multiplication tables. What am I even supossed to do ?? Here's my code : int main() …

OK.So i need to bild this table and so I did.But what I cant understand is why it works fine till I hit number 18.then sudenly like half of 1st number-s (array[x]) are missing. can someone please tell me whats the trick.Thank you. #include <iostream> using namespace std; int main() …