桶排序问题

问题描述

在用Bucket sort的时候，试了一下用链表数组的结构。
编译通过了，但是不知道为什么next指针用不了。

代码

typedef double ElemType;
typedef ElemType* Array;
typedef struct CTNode{
	ElemType data;
	struct CTNode *next;
}*ChildPtr;
typedef ChildPtr CTBox;
typedef CTBox* CTree;

//得到最后一个元素 
ChildPtr getRear(CTBox B){
	ChildPtr p = B;
	if(B){
		//while(p->next){
		//	p = p->next;
		//}
	}
	return p;
}

//链表中元素的排序
void SortCTNode(CTBox &Box){
	 ChildPtr p, q, head;
	 head = p = Box;
	 while(head){
		 head = head->next;
		 q = Box;
		 while(p->data > q->next->data && q->next){
			 q = q->next;
		 }
		 if(p != q){
			p->next = q->next;
			q->next = p;
		 }
		 p = head;
	 }
}

void BUCKET_SORT(Array &A, int n){
	CTree B = (CTBox*)malloc(n * sizeof(CTBox));
	CTBox newBox;
	ChildPtr newChild, p;
	for(int i = 0; i < n; i++){
		B[i] = NULL;
	} 
	for(i = 0; i < n; i++){
		if(!B[(int)ceil(n * A[i])]){
			newBox = (CTNode*)malloc(sizeof(CTNode));
			newBox->data = A[i];
			newBox->next = NULL;
			B[(int)ceil(n * A[i])] = newBox;
		}
		else{
			newChild = (CTNode*)malloc(sizeof(CTNode));
			newChild->data = A[i];
			newChild->next = NULL;
			p = getRear(B[(int)ceil(n * A[i])]);
			p->next = newChild;
		}
	}
	//依次给链表排序 
	for(i = 0; i < n; i++){
		if(B[i]){
			SortCTNode(B[i]);
		}
	}
	//将链表连接起来
	CTBox Final = (CTNode*)malloc(sizeof(CTNode));
	p = Final; 
	for(i = 0; i < n; i++){
		if(B[i]){
			p->next = B[i];
			p = getRear(B[i]); 
		}
	}
	//依次赋值给Array
	p = Final->next;
	for(i = 0; i < n; i++){
		A[i] = p->data;
		p = p->next;
	}
}