동적 할당된 개체를 퀵 소트하려는데 안 되네요.

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

#define MAX_NEIGHBOR    100


typedef struct _neighbor_list {
        int distance;
        char* hostport;
} NeighborList;

NeighborList *neighbor_list[MAX_NEIGHBOR];

int PrintList(int n);
int NeighborCompare(const void* n1, const void* n2);
int InsertNeighbor(NeighborList element);
int PrintList(int n);

int NeighborCompare(const void* n1, const void* n2)
{
        NeighborList* _n1 = (NeighborList*)n1;
        NeighborList* _n2 = (NeighborList*)n2;

        return (_n1->distance - _n2->distance);
}

int InsertNeighbor(NeighborList element)
{
        static int count  = 0;

        count++;
        if ( count > MAX_NEIGHBOR )
                return -1;

        neighbor_list[count-1] = (NeighborList*) malloc( sizeof(NeighborList) );
        neighbor_list[count-1]->hostport = (char*) malloc( strlen(element.hostport)+1 );

        neighbor_list[count-1]->distance = element.distance;
        strcpy(neighbor_list[count-1]->hostport, element.hostport);

        qsort(*neighbor_list, count-1, sizeof (NeighborList), NeighborCompare);

        return count;
}


int main(int argc, char** argv)
{
        int n = 0;

        NeighborList *element;
        element = (NeighborList*) malloc (sizeof(NeighborList));

        element->hostport = (char*) malloc (100);

        element->distance = 10;
        strcpy(element->hostport, "abcdefg");
        n = InsertNeighbor(*element);

        element->distance = 5;
        strcpy(element->hostport, "asdf");
        n = InsertNeighbor(*element);
        PrintList(n);

        element->distance = 6;
        strcpy(element->hostport, "oooo");
        n = InsertNeighbor(*element);
        PrintList(n);

        element->distance = 1;
        strcpy(element->hostport, "klj");
        n = InsertNeighbor(*element);
        PrintList(n);

        return 1;
}

InsertNeighbor 함수를 이용해서 새로운 데이터를 추가함과 동시에 정렬을 합니다. 그런데, NeighborList 구조체를 정적으로 선언해서 실행하면 잘 되는데, 동적으로 메모리 할당을 하니 비교 함수(NeighborCompare)에 이상한 값이 들어오네요. 결국 소트가 제대로 안 됩니다.