Segmentation Fault: 11

I am trying out a sorting algorithm that involves a large string of numbers. And whenever I try to run it, it gives the this error:

Segmentation Fault: 11

Any suggestions

(The commented code is not ready yet)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <cstdlib>
using namespace std;

void randominteger();
void shellSort(int[], const int, int[], int &);
//void Hibbard(int[], const int, int[], int &);
//void Sedgewick(int[], const int, int[], int &);
//void check (int[], const int, int[], int &);


int main()
{
    randominteger();
    return 0;
}

void randominteger()
{
    int n, slen = 17; //hlen = 15, sedlen = 8;
    int SHELLGAP[17] = {50000,25000,12500,6250,3125,1562,781,390,195,97,48,24,12,6,3,1};
    //int Hibbgap[15] = {32767,16383,8191,4095,2047,1023,511,255,127,63,31,15,7,3,1};
    //int sedggap[8] = {16577,4193,1073,281,77,23,8,1};
    const int length = 100000;
    int random[length+1];
    srand((unsigned)(time(0)));
    
    for (int i = 0; i < length; i++)
    {
        random[i] = (rand() % 50000) + 1;
    }
    
   
    
    for (int i = 0; i < length; i++)
    {
        cout << random[i] << " ";
    }
    
    cout << "-----> Welcome to AviatorBlue's Sorting System <-----";
    cout << "\n\nThe sequence of numbers above are what you will sort ^ ";
    cout << "\n\nChoose your sort:";
    cout << "\n1 - Shell Sequence Sort" << "\n2 - Hibbard Sequence Sort";
    cout << "\n3 - Sedgewick Sequence Sort";
    cout << "\n==> ";
    cin >> n;
    
    switch (n)
    {
        case 1:
            shellSort(random, length, SHELLGAP, slen);
            break;
        case 2:
          //  Hibbard(random, length, Hibbgap, hlen);
            break;
        case 3:
          //  Sedgewick(random, length, sedggap, sedlen);
            break;
        default:
            cout << "\nDon't do that again!\n\n";
    }
    
}

void shellSort(int random[], int length, int SHELLGAP[], int &slen)
{
    int x = 0;
    int MAX = length;
    int switchme;
    int stop;
    int tempX;
    int * gap = new int;
    gap = SHELLGAP;
    
    while (SHELLGAP[x] > 1)
	{
        stop = 0;
        while (stop == 0)
        {
            for (; x < slen; x++)
            {
                switchme = 100002;
                int k = 0;
                while (k < MAX)
                {
                    if (random[k] > random[k+SHELLGAP[x]])
                    {
                        tempX = random[k];
                        random[k] = random[k+SHELLGAP[x]];
                        random[k+SHELLGAP[x]] = tempX;
                        switchme = k;
                    }
                    k = k + SHELLGAP[x];
                }

                if (switchme == 100002)
                {
                    stop = 1;
                }
            }
        }
    }
	
	for(int i = 1; i < MAX; i++)
    {
        cout << random[i] << "  ";
    }
	cout << "(Sorted array)" << "\n";
    cout << "\nPress ENTER to continue..." << endl;
    getchar();

}

/*void Hibbard(int random[], int length, int Hibbgap[], int &hlen)
{
    int x = 0;
    int switchme;
    int stop;
    int tempX;
    int * gap = new int;
    gap[hlen] = *Hibbgap;
    
    while (gap[x] > 1)
	{
        stop = 0;
        while (stop == 0)
        {
            switchme = 0;
            for (int k = 0; k < length; k++, x++)
            {
                if (random[k] > random[k+gap[x]])
                {
                    tempX = random[k];
                    random[k] = random[k+x];
                    random[k+x] = tempX;
                    switchme = k;
                }
            }
            
            if (switchme == 0)
            {
                stop = 1;
            }
        }
        for (int i=1; i<length; i++)
        {
            cout << random[i] << "  ";
        }
        cout << "\n";
        x = int(x / 2);
	}
	
	for(int i=1; i<length; i++)
    {
        cout << random[i] << "  ";
    }
	cout << "(Sorted array)" << "\n";
    cout << "\nPress ENTER to continue..." << endl;
    getchar();
    

}

void Sedgewick(int random[], int length, int sedggap[], int &sedlen)
{
    int x = 0;
    int switchme;
    int stop;
    int tempX;
    int * gap = new int;
    gap[sedlen] = *sedggap;
    
    while (gap[x] > 1)
	{
        stop = 0;
        while (stop == 0)
        {
            switchme = 0;
            for (int k = 0; k < length; k++, x++)
            {
                if (random[k] > random[k+gap[x]])
                {
                    tempX = random[k];
                    random[k] = random[k+x];
                    random[k+x] = tempX;
                    switchme = k;
                }
            }
            
            if (switchme == 0)
            {
                stop = 1;
            }
        }
        for (int i=1; i<length; i++)
        {
            cout << random[i] << "  ";
        }
        cout << "\n";
        x = int(x / 2);
	}
	
	for(int i=1; i<length; i++)
    {
        cout << random[i] << "  ";
    }
	cout << "(Sorted array)" << "\n";
    cout << "\nPress ENTER to continue..." << endl;
    getchar();
}*/

closed account (Dy7SLyTq)
is it outputting anything? because if its not then its because random is too big.
Yes I am able to display all of the random integers. I don't think that that is the problem, thanks though.
Topic archived. No new replies allowed.