私のプログラムでは、Linked List を使用して Radix Sort を使用して 9 桁の数字を並べ替えていますが、何らかの理由で正しく並べ替えられません。
これが私が自分の番号を生成する方法です:
void genData(int *dta, int n)
{
// generate the numbers at random
for(int i=0; i < n; i++)
dta[i] = rand()%889 + 111 + 1000*(rand()%889 + 111) + 1000000*(rand()%889 + 111);
}
これが Radix Sort 関数です。外側のループは 3 回実行されます。3 桁のセットごとに 1 回。
int radixSort(int *dta, int n, int *out)
{
// the dta array contains the data to be sorted.
// n is the number of data items in the array
// out is the array to put the sorted data
node *bucket[1000];
int count = 0;
for(int i = 0; i < n; i++)out[i] = dta[i];
for (int pass = 0; pass < 3; pass++) // outer loop
{
for(int j = 0; j < 1000; j++) // set bucket[] to all zeroes (NULL) for each pass
{
bucket[j] = NULL;
}
for(int i = 0; i < n; i++) // inner loop -- walks through the out array (which contains the data to be sorted)
{
int index = 0;
int tmp = 0;
switch(pass)
{
case 0:
index = out[i] % 1000;
break;
case 1:
tmp = out[i]/1000; // tmp = 123456
index = tmp%1000; // mid = 456// set index to the middle 3 digits
break;
case 2:
tmp = out[i]/1000; // set index to the first 3 digits
index = tmp/1000;
break;
};
//Create new head node if nothing is stored in location
if(bucket[index] == NULL)
{
node *newNode = new node(0, bucket[0]);
}
else
{
node *newNode = new node(out[i], NULL); //Created new node, stores out[i] in it
node *temp = bucket[index];
while(temp->next != NULL) // finds the tail of the Linked List
{
temp = temp->next;
count++; //For Big-O
}
temp->next = newNode; // make tail point to the new node.
}
count++; //For Big-O
} // end of the inner (i) loop
int idx = 0; // for loading the out array
for(int i = 0; i < 1000; i++) // walk through the bucket
{
if(bucket[i] == NULL)continue; // nothing was stored here so skip to the next item
// something is stored here, so it is put into the out array starting at the beginning (idx)
out[idx++] = bucket[i]->data;
if(bucket[i]->next->next != NULL || bucket[i]->next->next)
// now see if there are more nodes in the linked list that starts at bucket[i]. If there are, put their data into out[idx++]
{
out[idx++] = bucket[i]->data;
}
count++; //For Big-O
}
}// end of the outer loop pass). The output (out) from this pass becomes the input for the next pass
return count; // Again -- for Big-O
}
問題は、作成した新しいノードにある可能性があると思います。私は何を間違っていますか?