#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);
}

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

array에 10, 20, 15등의 숫자를 값에 따라 오름차순으로 배열하고 삽입해야하는데요

처음 array기 비었을때는 했는데 else 일때 어떻게 짜야 할까요? 조언좀 부탁드립니다.