---

Algorithm for deleting a node from the Beginning in circular linked list

---

Step 1: Check for Overflow 
           if start = Null then 
              print list is empty
              Exit 
        End if
Step 2: set ptr = start
Step 3: set start = start -> next
Step 4: print Element deleted is , ptr -> info 
Step 5: set last -> next = start
Step 6: free ptr 
Step 7: EXIT

Program

delete-first(node*start)
{
  Node *p;
  p = Start;
  if(p == null)
  {
	printf("List is Empty");
  }
  else
    p = Start;
    Start = Start -> next;
    printf("Element deleted is =", p -> num);
}

---