#include <stdio.h>

struct node {
struct node* prev;
struct node* next;
int value;
};

struct node array;
int g_index = -1;
struct node* init;

void insert(int v);
void _remove(int v);
void print();

int main(void)
{
insert(10);
insert(20);
insert(15);
insert(17);
insert(5);
insert(25);
insert(3);
insert(27);
insert(23);

return 0;
}

void insert(int v)
{
//Managed nodes are defined as ones each whose value is not zero.
//'init' always indicates the node whose value is minimal among managed nodes.
//e.g., managed nodes are '10', '20', and '15' (meaning insert(10); insert(20);insert(15); are called in turn), then, 'init' indicates the node whose value is '10'.
//All managed nodes are connected each other with member variables 'prev' and 'next'.
//Also, for each node (of managed ones), the value of the 'prev' node should be smaller than the node (except the first one), and
//the value of the 'next' node should be larger than the node (except the last one).
//'g_index' always indicates the index (of struct node array) of the node whose value was recently assigned.
//e.g., managed nodes are '10', '20', and '15'(meaning insert(10); insert(20);insert(15); are called in turn), then, array[g_index] indicates the node whose value is 15.
//'prev' of the node indicated by 'init' is null.
//'next' of the last node among manage nodes is null.
g_index++;
array[g_index].value = v;

if (g_index == 0)
init = &array[g_index];
else
{
struct node* current = init;

while (current->next != NULL && current->next->value < current->value)
current = current->next;

if (current->next == NULL)
{
current->prev->next = current;

}

else if (current->prev = =NULL)
{
current->next->prev = current;
}
else
{
current->next->prev = current;
current->prev->next = current;

}
}

//the function 'print' should be called before the end of 'insert' function
print();
}

이렇게 연결하는게 맞나요?

디버깅을 하다보면

current->next->prev = current;
current->prev->next = current;

부분에서 처리되지 않은 예외가 throw됐다고 뜨는데 뭐가 문제일까요?