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



void swap(int *a, int *b);
void putIn(Node **Table,int position, int N);
void Insert( Node** Table, int N, int score, char* name )
{
    int i=0;
    Table[N]=(Node*)malloc(sizeof(Node));
    (*Table[N]).name=(char*)malloc(sizeof(char)*105);
    (*Table[N]).score=score;
    strcpy((*Table[N]).name,name);
    for(i=0;i<=N-1;i++)
    {
        if(N==0)break;
        if((*Table[N]).score>(*Table[i]).score)
        {
            putIn(Table,i,N);
            break;
        }
        else if((*Table[N]).score==(*Table[i]).score)
        {
            if(strcmp((*Table[N]).name,(*Table[i]).name)<0)
            {
                putIn(Table,i,N);
                break;
            }
        }
    }
    
    return;
}
void Delete( Node** Table, int N, char* name )
{
    int i=0;
    for(i=0;i<=N-1;i++)
    {
        if(strcmp((*Table[i]).name,name)==0)
        {
            free((*Table[i]).name);
            free(Table[i]);
            Table[i]=NULL;
            break;
        }
    }
    for(int j=i;j+1<=N-1;j++)Table[j]=Table[j+1];
    Table[N-1]=NULL;
    return;
}
int* Top( Node** Table, int N, int x)
{
    int* a=(int *)malloc(sizeof(int)*(x));
    for(int i=0;i<=x-1;i++)*(a+i)=i;
    return a;
}
void swap(int *a, int *b)
{
    int temp;
    temp=*a;
    *a=*b;
    *b=temp;
    return;
}
void putIn(Node **Table,int position, int N)
{
    Node *temp=Table[N];
    for(int i=N;i>position;i--)Table[i]=Table[i-1];
    Table[position]=temp;
}