#include <stdio.h>

#define MAXLEN 100

typedef struct {
   int len;
   char element[MAXLEN];
} olist;

olist init ()
{
   olist L;

   L.len = 0;
   return L;
}

olist insert ( olist L , char ch , int pos )
{
   int i;

   if ((pos < 0) || (pos > L.len)) {
      fprintf(stderr, "insert: Invalid index %d\n", pos);
      return L;
   }
   if (L.len == MAXLEN) {
      fprintf(stderr, "insert: List already full\n");
      return L;
   }
   for (i = L.len; i > pos; --i) L.element[i] = L.element[i-1];
   L.element[pos] = ch;
   ++L.len;
   return L;
}

olist delete ( olist L , int pos )
{
   int i;

   if ((pos < 0) || (pos >= L.len)) {
      fprintf(stderr, "delete: Invalid index %d\n", pos);
      return L;
   }
   for (i = pos; i <= L.len - 2; ++i) L.element[i] = L.element[i+1];
   --L.len;
   return L;
}

int isPresent ( olist L , char ch )
{
   int i;

   for (i = 0; i < L.len; ++i) if (L.element[i] == ch) return i;
   return -1;
}

char getElement ( olist L , int pos )
{
   if ((pos < 0) || (pos >= L.len)) {
      fprintf(stderr, "getElement: Invalid index %d\n", pos);
      return '\0';
   }
   return L.element[pos];
}

void print ( olist L )
{
   int i;

   for (i = 0; i < L.len; ++i) printf("%c", L.element[i]);
}

int main ()
{
   olist L;

   L = init();
   L = insert(L,'a',0);
   printf("Current list is : "); print(L); printf("\n");
   L = insert(L,'b',0);
   printf("Current list is : "); print(L); printf("\n");
   L = delete(L,5);
   printf("Current list is : "); print(L); printf("\n");
   L = insert(L,'c',1);
   printf("Current list is : "); print(L); printf("\n");
   L = insert(L,'b',3);
   printf("Current list is : "); print(L); printf("\n");
   L = delete(L,2);
   printf("Current list is : "); print(L); printf("\n");
   L = insert(L,'z',8);
   printf("Current list is : "); print(L); printf("\n");
   L = delete(L,2);
   printf("Current list is : "); print(L); printf("\n");
   printf("Element at position 1 is %c\n", getElement(L,1));
}