Giving me segmentation fault

#1

#include
using namespace std;

void bubbleSort(int *arr,int len) {
if(len<=1) {
return;
}

for(int i=0;i<len-1;i++) {
    if(arr[i]>arr[i+1]) {
        swap(arr[i],arr[i+1]);
    }
}

bubbleSort(arr,len-1);

}

void bubble_sort_recursive(int *arr,int j,int len) {
if(len==1) {
return;
}

if(j==len-1) {
    bubble_sort_recursive(arr,0,len-1);
}

if(arr[j]>arr[j+1]) {
    swap(arr[j],arr[j+1]);
}

bubble_sort_recursive(arr,j+1,len);

}

int main() {
int arr[]={2,1,5,4,7,6};

int len=sizeof(arr)/sizeof(arr[0]);

///bubbleSort(arr,len);

bubble_sort_recursive(arr,0,len);

for(int i=0;i<len;i++) {
    cout << arr[i] << " ";
}


return 0;

}

#2

#include<bits/stdc++.h>
using namespace std;

void bubbleSort(int *arr,int len) {
if(len<=1) {
return;
}

for(int i=0;i<len-1;i++) {
    if(arr[i]>arr[i+1]) {
        swap(arr[i],arr[i+1]);
    }
}

bubbleSort(arr,len-1);

}

void bubble_sort_recursive(int *arr,int j,int len) {
if(len==1) {
return;
}

if(j==len-1) {
    bubble_sort_recursive(arr,0,len-1);
     **return;**     ////////////////////
}

if(arr[j]>arr[j+1]) {
    swap(arr[j],arr[j+1]);
}

bubble_sort_recursive(arr,j+1,len);

}

int main() {
int arr[]={2,1,5,4,7,6};

int len=sizeof(arr)/sizeof(arr[0]);

///bubbleSort(arr,len);

bubble_sort_recursive(arr,0,len);

for(int i=0;i<len;i++) {
    cout << arr[i] << " ";
}


return 0;

}

#4

you were missing return statement in if(j==len-1) i have highlighted it.
i hope its cleared now if yes dont forget to mark it as resolved @premang :smiley:

#5

thank youuuuuuuuuuuuuuu :wink:

#6

@premang no problem just mark it as resolved :smiley: