void QueueAppend(LQueue *Q, int x)
{
    LQNode *p = (LQNode *)malloc(sizeof(LQNode));++++++++++++++++++++++++++++

   p->data = x;
   p->next = NULL;

   if(Q->rear != NULL)
       Q->rear->next = p;
   Q->rear = p;
   if(Q->rear == NULL)
       Q->front == p;
}

void RadixSort(int *a,int n, int m,int d)  
{
      int i, j, k, power = 1;
      LQueue *tub;
      tub = (LQueue *)malloc(sizeof (LQueue )* d);

      for(i = 0; i < d; i++)
          QueueInitiate(&tub[i]);                            
      for(i = 0; i < m; i++){
          if(i == 0)
              power = 1;
          else
                power = power *d;
          for(j = 0; j < n; j++){
              k = a[j] /power - (a[j] /(power * d)) * d;
              QueueAppend(&tub[k], a[j]);   
          }
          
          k = 0;
          for(j = 0; j < d; j++)
              while(QueueNotEmpty(tub[j]) != 0){
                  QueueDelete(&tub[j], &a[k]);++++++++++++++++++++++
                  k++;
              }
      }
}

RadixSort函数调用QueueAppend时，+++++++++++++++++标志的语句触发了断点。我在main函数中直接调用QueueAppend函数时却没有触发。编译器是vs2012

#include <stdio.h>
#include <stdlib.h>

typedef struct qnode
{
    int data;            /*队列结点*/
    qnode *next;
}LQNode;

typedef struct                                                                          
{
    LQNode *front;           /*队列头尾指针*/                      
    LQNode *rear;                                  
}LQueue;

void QueueInitiate(LQueue *Q)
{
    Q->rear = NULL;
    Q->front = NULL;
}

void QueueAppend(LQueue *Q, int x)
{
    LQNode *p = (LQNode *)malloc(sizeof(LQNode));++++++++++

   p->data = x;
   p->next = NULL;

   if(Q->rear != NULL)
       Q->rear->next = p;
   Q->rear = p;
   if(Q->rear == NULL)
       Q->front == p;
}

int QueueNotEmpty(LQueue Q)
{
    if(Q. front == NULL) return 0;
    else return 1;
}

int QueueDelete(LQueue *Q,int *d)
{
    LQNode *p;

    if(Q->front == NULL){
         printf ("队列已空无数据元素出队列！ \n");
         return 0;
    }
    else{
      *d  = Q->front->data;
      p = Q->front;
      Q->front = Q->front->next;
      if(Q->front == NULL) Q->rear = NULL;
    }

      free(p);
      return 1;
}

void RadixSort(int *a,int n, int m,int d)  
{
      int i, j, k, power = 1;
      LQueue *tub;
      tub = (LQueue *)malloc(sizeof (LQueue )* d);

      for(i = 0; i < d; i++)
          QueueInitiate(&tub[i]);                            
      for(i = 0; i < m; i++){
          if(i == 0)
              power = 1;
          else
                power = power *d;
          for(j = 0; j < n; j++){
              k = a[j] /power - (a[j] /(power * d)) * d;
              QueueAppend(&tub[k], a[j]);   
          }
          
          k = 0;
          for(j = 0; j < d; j++)
              while(QueueNotEmpty(tub[j]) != 0){
                  QueueDelete(&tub[j], &a[k]);
                  k++;
              }
      }
}

void main()
{
    stu *class1 = (stu *)calloc(sizeof(stu),1);
    /*int *class1_average = (int *)malloc(sizeof(stu));*/++++++++++++++++++++
    int class1_average[8] = {21,31,41,81,51,61,71,11};

    RadixSort(class1_average,8,2,10);
    printf("OK");
    
}

这是全部代码RadixSort里要用到的代码 利用链式队列来做基数排序的 ++++标志的本来是要读取文件里的数据的，这里我换成数组了。 RadixSort参数分别是指针，数组长度，数据的位数，进制

[此贴子已经被作者于2020-10-12 16:00编辑过]

malloc下面的代码有问题也会导致malloc触发断点吗？

[此贴子已经被作者于2020-10-12 15:56编辑过]

3楼的代码就是了 就只是用radixsort来为average数组排序 其他的代码没有用上3楼代码的东西 我这边调试是一直触发断点的

谢谢了 已经解决了 仔细看了一遍其他代码 还真出错了