can you try the following piece of code. #include<stdio.h> count(int); int main() { int x=4; count(x); return 0; } int count(int n) { if(n>0) { printf(“%d”,n); return count(n-1); } else { printf(“%d”,n); return n; } } 4 solved How recursion works in this code? [duplicate]
A little help. C | JS —————–|—————— int x; | var x; —————–|—————— int xs[n]; | var xs = []; —————–|—————— printf(…) | console.log(…) —————–|—————— int f (int x) { | function f (x) { … | … return y; | return y; } | } The remaining syntax from your post is almost identical … Read more
Your fill function takes the parameter a by value, which means a copy is made. No changes to a inside the function will affect the variable you passed to the function. I suggest you make the function pass the object by reference: void fill(stack<int>& a, int cap) Now changes to a will update the object … Read more
From the man page: The realloc() function changes the size of the memory block pointed to by ptr to size bytes. So instead of: int *newbuffer = (int*) realloc (stacky, size); you probably want int *newbuffer = (int*) realloc (stacky, size * sizeof(int)); BTW: No need for cast when using malloc and friends. See Do … Read more
1.) First of all there is no return statements at the end of the procedure(s). 2.) Since I am using floating point AND STACK I put finit before each procedure call. 3.) I needed to establish a stack frame in the beginning of each procedure push ebp ; save base pointer mov ebp, esp ; … Read more
A working variation of my solution appears below. The reason I had to do it this way is because while I was able to dereference (**Array)[MAX_FILENAME_AND_PATHNAME_LEN] I was only able to modify the first string array in the array. The string array was initialized and filled several strings. While I could reference a string contained … Read more
why not the program crash, or print some random garbage? The program will not crash as you are not accessing any illegal memory. The stack memory is a part of your program and as long as you are accessing the memory in a valid range the program will not crash. Yes, you can modify the … Read more
Your code has some confusion in its handling of the ‘{‘ and ‘}’ characters. It should be entirely parallel to how you handle ‘(‘ and ‘)’. This code, modified slightly from yours, seems to work properly: public static boolean isParenthesisMatch(String str) { if (str.charAt(0) == ‘{‘) return false; Stack<Character> stack = new Stack<Character>(); char c; … Read more
The first mistake is pushing all the characters on the stack outside of the if statement. Also you should check if stack is empty before removing items from it. Otherwise EmptyStackException is thrown. // stack1.push(S.charAt(i)); <– remove this line if (S.charAt(i)!=’#’) { stack1.push(S.charAt(i)); }else if (!stack1.isEmpty()) { // <– add this check stack1.pop(); } The … Read more
If you want to enter data per line, here is an example: class Book { int number; int year; std::string language std::string name; std::string title; public: friend std::istream& operator>>(std::istream& input, Book& b); //… }; std::istream& operator>>(std::istream& input, Book& b) { std::string text_line; std::getline(input, text_line); std::istringstream text_stream(text_line); text_stream >> b.number >> b.year >> b.language >> b.name … Read more
You already have created methods so you know how to do this. You can create another method called reverseUsingPop(char[] characters). and in here execute the loop to print them. From looking at your code it seems like you should have seen everything to do this. So from your main method you can call that method. … Read more
public static void main(String args[]) { Stack stack = new Stack(); for (int i = 1; i <= 10; i++) stack.push(new Integer(i)); while (!stack.empty()) System.out.print(stack.pop() + ” “); System.out.println(” No element in stack”); } This works fine for me. solved how to Permanentaly remove data from stack once it has been pop out
The issue is you are not setting top properly, in your constructor you declared a local top which left stack::top uninitialized. stack(){ int top=-1; // } update to below code, should work: stack() { top = -1; } 1 solved Infix to Postfix conversion – segmentation fault [closed]
The many comments (and even answers) focus on the risks in your implementation. Yet the question stands. As directly demonstrated below rectifying the perceived code shortcomings would not change anything significant about the performance. Here is the OP’s code modified to be (A) safe, and (B) supporting the same operations as std::stack, and (C) reserving … Read more
This is how a stack works: You push elements into it like this. The freshly added elements are always “on top” since it is a Last in First Out (LIFO) structure. You can only access the top element: Then You can pop these elements, but pop always removes the top one, like this: If i … Read more