C recursive function for product receiving segmentation fault

C recursive function for product receiving segmentation fault

By : Lockito Marks
Date : November 20 2020, 11:01 PM
This might help you I think instead of taking the mid.You can consider doing like this too check the following code
code :
int product(int a, int b) 

    if (a >= b) 
       return a;
    else {

      return a*product(a+1,b);

int main() {

    int p;
    p = product(5,10);
    printf("product is %d\n", p);

    return 0;


Share : facebook icon twitter icon
Segmentation fault in recursive function

Segmentation fault in recursive function

By : nofilikewifi
Date : March 29 2020, 07:55 AM
wish helps you I recently read about memoization for the first time(I'm a noob) and I wanted to try and make a fibonacci function that uses memoization. This is what I've tried, but anything over 1 just gives me a segmentation fault. Any help is appreciated!
code :
vector<unsigned int> fibvector; 
static vector<unsigned int> fibvector(MAXELEMENTS); 
if(fibvector[n] != 0) return fibvector[n];
unsigned int fibonacci( unsigned int n )
    static vector<unsigned int> fibvector;
    unsigned int fib;

    if ( fibvector.size() > n )
        return fibvector[n];
    if(n <=1){
       fib = n;
       unsigned int v2 = fibonacci( n-2 );
       unsigned int v1 = fibonacci( n-1 );
       fib = v2 + v1;
    return fib;
Segmentation Fault with Recursive Function

Segmentation Fault with Recursive Function

By : Lungelo
Date : March 29 2020, 07:55 AM
seems to work fine I am very new to programming in C, and can't seem to locate the cause of the segmentation error that I have been getting. The program I wrote is as follows:
code :
if (x = 0) 

is the same as: 

x = 0; if (x)
Why does my recursive function cause a segmentation fault?

Why does my recursive function cause a segmentation fault?

By : Pavel Bondar
Date : March 29 2020, 07:55 AM
I wish this helpful for you You are accessing memory you can't access. It just isn't obvious in the code (like a dangling pointer). Recursion is tricky; you can easily overflow the stack. The stack stores information when you enter a function (registers or addresses of parameters, saved values of registers used in the calling function and the called function, and a return pointer (where to jump to when you finish the function) basically.
The stack has a certain size. It might be quite large, but it is finite. In recursion, you keep calling the same function from within itself. If this happens too many times, you will "overflow the stack" -- that is, try to "push" more info onto the stack when it is already full, which means at an address past the end of the stack -- memory you may not have access to. (If you do have access to it, you maybe overwriting one of your variables or some such.)
Segmentation fault in C++ recursive function

Segmentation fault in C++ recursive function

By : paleywiener
Date : March 29 2020, 07:55 AM
will help you You are indexing out of range. if i == s.length()-1 (which is the last character's index), then your s[i+1] will be out of range.
Also just in general the logic is flawed because you will restart the operation from the beginning each time you encounter matching. If you have 'abccba' I assume you would want 'abcba', however your code would return abca. The time complexity of your solution is less than ideal. This could be done in linear time.
Why am I receiving segmentation fault in my insert function of a tree?

Why am I receiving segmentation fault in my insert function of a tree?

By : user01231
Date : March 29 2020, 07:55 AM
I wish this helpful for you The segmentation fault occurs in the insert function specifically at the *root = x; in the first if statement. The functions were already laid out and we just had to implement them so I cant add another parameter or anything. Ive been stuck on this for a while and have no idea what it could be. The root pointer was allocated memory so I really dont know what the problem is. Any help is appreciated, thanks. , This should be obvious:
Related Posts Related Posts :
  • Comparison of one element in array to all other elements in same array
  • In C, can we read from pipes without busywaiting, may be using callbacks or other ways?
  • Check current time (without date) is between two times in C
  • I have something like this code and I would like to know how to get the number of elements of the array I pass in, if th
  • Difference between debug and release executable, in example code, in terms of symbols and functions optimised
  • find the unmatched elements at each index in two arrays
  • Structure Output are Different
  • Linux read() call not returning error when i Unplug serial cable
  • fread and ferror don't set errno
  • ATmega32U4: enabling interrupts hangs
  • Printing 2d array box
  • C - Dynamic Memory Allocation
  • How to read a string from a C function into Go?
  • Application is getting killed without any reason. Suspecting high BSS. How to debug it?
  • Dividing with/without using floats in C
  • Preprocessor conditional distributed across `#include` files
  • Typecasting a void pointer in a Linked List
  • Basic Functions in C
  • A for loop that calculates the even or odd then adds them up
  • Pascal String to cstring
  • Assigning to two pointers at the same time in C
  • getchar returns a different character
  • Understanding the enhanced syntax of for loop
  • Comparing char to string - C
  • How to omit the Bios Parameter Block in a bootloader?
  • Search linked list by substring and create a new linkedlist with all structs that contain the substring
  • Procedure and pointers C
  • RegOpenCurrentUser(KEY_WRITE) on newly created user
  • C Program with Pointer Increment False Values
  • Why won't a chunck of this program run in Linux but will on Windows?
  • Flow of the fork, how many forks do I have?
  • C String concatenation using memcpy not appending
  • Properly Partitioning QuickSort Array
  • Place String Literal Before Variable
  • Sending payload with sigaction
  • using sizeof(void) inside malloc
  • Getting unused variable warning
  • C - Writing on second line of file
  • Unable to copy ip address from string to sockaddr_in
  • Write a in c program using loop control to produce the following output
  • GCC not warning on implicit cast from void * to void **
  • char[] vs char* in scanf C when writing memory
  • Recursive Calculation of a queue
  • How to rotate bits to the left and add rotated bits to the right
  • Print a size_t in a OS-independent architecture independent way
  • Radix Sort for floats in C - negative values get corrupted
  • ANSI C Separating the data from the file
  • Pascal - how sets work?
  • K&R 1.6 Sample Code Displays Long Integers
  • Unexpected Infinite for loop
  • using struct value in realloc gives segmentation fault
  • c - Error: "incomplete type is not allowed" , IAR compiler
  • How use correctly the pointers in a multi dimensional array?
  • Optimize hollow diamond pattern printing in c with minimum loops
  • Store an string on a Shared Memory C
  • How to create a sine function in c
  • Initializing n integers in 2-dimensional array
  • Why is executing callback functions in kernel mode bad?
  • What is wrong with my bubble sort?
  • My Program has a couple of bugs and I dont know how to fix them
  • shadow
    Privacy Policy - Terms - Contact Us © soohba.com