Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Welcome to Software Development on Codidact!

Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.

Post History

37%
+1 −3
Q&A Why does this code that uses a pointer-to-pointer-to-int segfault?

Hello folks, can someone resolve this seg fault with me please, i can't find the error where it occur. Thank you. #include <stdlib.h> #include <stdio.h> int ft_ultimate_range(int *...

1 answer  ·  posted 3y ago by M3dc0d‭  ·  last activity 3y ago by Lundin‭

#2: Post edited by user avatar Canina‭ · 2021-07-13T16:31:47Z (over 3 years ago)
  • Create a function ft_ultimate_range which allocates and assigns an array of ints. This int array should contain all values between min and max. • Min included - max excluded.
  • Why does this code that uses a pointer-to-pointer-to-int segfault?
  • Hello folks, can someone resolve this seg fault with me please, i can't find the error where it occur. Thank you.
  • ```#include <stdlib.h>
  • #include <stdio.h>
  • int ft_ultimate_range(int **range, int min, int max)
  • {
  • int lentgh;
  • int i;
  • int mi;
  • mi = min;
  • lentgh = max - min;
  • if (min >= max)
  • {
  • // *range = NULL;
  • return (0);
  • }
  • *range = malloc(sizeof(int) * lentgh);
  • if(!range)
  • {
  • return 0;
  • }
  • i = 0;
  • while (min < max)
  • {
  • range[0][i] = mi;
  • i++;
  • mi++;
  • }
  • return (i);
  • }
  • `int main()
  • {
  • int i = 0;
  • int min = 5;
  • int max = 19;
  • int **range = 0;
  • int ptr = ft_ultimate_range(range, min, max);`
  • while(i < max - min)
  • {
  • printf("%d\n", ptr);
  • i++;
  • }
  • return (0);
  • }```
  • Hello folks, can someone resolve this seg fault with me please, i can't find the error where it occur. Thank you.
  • ```
  • #include <stdlib.h>
  • #include <stdio.h>
  • int ft_ultimate_range(int **range, int min, int max)
  • {
  • int lentgh;
  • int i;
  • int mi;
  • mi = min;
  • lentgh = max - min;
  • if (min >= max)
  • {
  • // *range = NULL;
  • return (0);
  • }
  • *range = malloc(sizeof(int) * lentgh);
  • if(!range)
  • {
  • return 0;
  • }
  • i = 0;
  • while (min < max)
  • {
  • range[0][i] = mi;
  • i++;
  • mi++;
  • }
  • return (i);
  • }
  • int main()
  • {
  • int i = 0;
  • int min = 5;
  • int max = 19;
  • int **range = 0;
  • int ptr = ft_ultimate_range(range, min, max);`
  • while(i < max - min)
  • {
  • printf("%d\n", ptr);
  • i++;
  • }
  • return (0);
  • }
  • ```
#1: Initial revision by user avatar M3dc0d‭ · 2021-07-13T11:45:03Z (over 3 years ago)
Create a function ft_ultimate_range which allocates and assigns an array of ints. This int array should contain all values between min and max. • Min included - max excluded.
Hello folks, can someone resolve this seg fault with me please, i can't find the error where it occur. Thank you.

```#include <stdlib.h>
 #include <stdio.h>
 int ft_ultimate_range(int **range, int min, int max)
 {
    int lentgh;
    int i;
    int mi;
    
    mi = min;
    lentgh = max - min;
    if (min >= max)
    {
        // *range = NULL;
        return (0);
    }
    *range = malloc(sizeof(int) * lentgh);
    if(!range)
    {
        return 0;
    }
    i = 0;
    while (min < max)
    {
        range[0][i] = mi;
        i++;
        mi++;
    }
    return (i);
}

`int main()
 {
    int i = 0;
    int min = 5;
    int max = 19;
    int **range = 0;
    int ptr = ft_ultimate_range(range, min, max);`

    while(i < max - min)
    {
        printf("%d\n", ptr);
        i++;
    }
    return (0);
}```