using System;

                     //You have one direction sorted LinkedList (you need to create it yourself, 

                    //don't use predefined) with loop. Insert element without breaking the loop and sorting

public class Program

{

    public class Node

    {

        public int data;

        public Node next;

        public int flag;

        public Node(int d)

        {

            data = d;

            next = null;

            flag = 0;

        }

    }

    public class LinkedList

    {

        public Node head;

​

        public void sortedInsert(Node new_node)

        {

            Node current;

​

            if (head == null || head.data >= new_node.data)

            {

                new_node.next = head;

                head = new_node;

            }

            else

            {

                current = head;

​

                while (current.next != null && current.next.flag == 0 && current.next.data < new_node.data){

                    current = current.next;

                    current.flag = 1;

                }

​

                new_node.next = current.next;

                current.next = new_node;

            }

        }

​

        /*Utility functions*/

​

        /* Function to create a node */

        public Node newNode(int data)

        {

            Node x = new Node(data);

            return x;

        }

​

        /* Function to print linked list */

        public void printList()

        {

            Node temp = head;

            while (temp != null)

            {

                Console.Write(temp.data + " ");

                temp = temp.next;

            }

        }

    }

    public static void Main()

    {

        LinkedList llist = new LinkedList();

            Node new_node;

​

            new_node = llist.newNode(5);

            llist.sortedInsert(new_node);

​

            new_node = llist.newNode(10);

            llist.sortedInsert(new_node);

​

            new_node = llist.newNode(7);

            llist.sortedInsert(new_node);

​

            new_node = llist.newNode(3);

            llist.sortedInsert(new_node);

​

            new_node = llist.newNode(1);

            llist.sortedInsert(new_node);

​

            new_node = llist.newNode(9);

            llist.sortedInsert(new_node);

​

        new_node = llist.newNode(11);

            llist.sortedInsert(new_node);

            Console.WriteLine("Created the Linked List");

            llist.printList();

    }

}