C# Online Compiler | .NET Fiddle

<no name> by Anonymous

public class Note
{
	public string Title
	{
		get;
		set;
	}

	public string Description
	{
		get;
		set;
	}

	public string Type
	{
		get;
		set;
	}

	public int Priority
	{
		get;
		set;
	}

	private int id;
	public int ID
	{
		get
		{
			return id;
		}
	}

	public Note(string title, string description, string type, int priority, int id)
	{
		Title = title;
		Description = description;
		Type = type;
		Priority = priority;
		this.id = id;
	}
}

public class Node
{
	public Note Info
	{
		get;
		set;
	}

	public Node Next
	{
		get;
		set;
	}

	public Node(Note note)
	{
		Info = note;
		Next = null;
	}

	public Node()
	{
		Info = null;
		Next = null;
	}
}

public class LIST
{
	private Node head;
	private Node tail;
	public Node Head
	{
		get
		{
			return head;
		}
	}

	public Node Tail
	{
		get
		{
			return tail;
		}
	}

	public LIST()
	{
		head = tail = null;
	}

	public bool IsEmpty()
	{
		return (head == null);
	}

	public void AddFirst(Node node)
	{
		if (IsEmpty())
		{
			head = tail = node;
			tail.Next = null;
		}
		else
		{
			node.Next = head;
			head = node;
		}
	}

	public void AddLast(Node node)
	{
		if (IsEmpty())
		{
			head = tail = node;
			tail.Next = null;
		}
		else
		{
			tail.Next = node;
			tail = node;
			tail.Next = null;
		}
	}

	public void AddNodeAfter(Node node1, Node node2)
	{
		node2.Next = node1.Next;
		node1.Next = node2;
		if (tail == node1)
		{
			tail = node2;
			tail.Next = null;
		}
	}

	public void AddNodeBefore(Node node1, Node node2)
	{
		AddNodeAfter(node1, node2);
		Note temp = node1.Info;
		node1.Info = node2.Info;
		node2.Info = temp;
	}

	public void RemoveFirst()
	{
		if (IsEmpty())
			return;
		if (head == tail)
		{
			head.Dispose();
			head = tail = null;
		}
		else
		{
			Node node = head.Next;
			head.Dispose();
			head = node;
		}
	}

	public void RemoveLast()
	{
		if (IsEmpty())
			return;
		if (head == tail)
		{
			tail.Dispose();
			head = tail = null;
		}
		else
		{
			Node node = head;
			while (node.Next != tail)
				node = node.Next;
			tail.Dispose();
			tail = node;
			tail.Next = null;
		}
	}

	public void RemoveAfter(Node node)
	{
		if (IsEmpty() || node == tail)
			return;
		Node nextNode = node.Next;
		node.Next = nextNode.Next;
		if (nextNode == tail)
		{
			tail = node;
			tail.Next = null;
		}

		nextNode.Dispose();
	}

	public void RemoveBefore(Node node)
	{
		if (IsEmpty() || head == node)
			return;
		if (head.Next == node)
			RemoveFirst();
		else
		{
			Node p = head;
			while (p.Next.Next != node)
				p = p.Next;
			RemoveAfter(p);
		}
	}

	//sua
	private void RemoveNode(Node node)
	{
		if (IsEmpty())
			return;
		else if (head == tail && head == node)
		{
			head = tail = null;
			node.Dispose();
		}
		else if (head == node)
		{
			head = node.Next;
			node.Dispose();
		}
		else
		{
			Node p = head;
			while (p.Next != node)
				p = p.Next;
			if (tail == node)
				tail = p;
			p.Next = node.Next;
			node.Dispose();
		}
	}

	public Node SearchNode(Note note)
	{
		Node resnode = head;
		while (resnode != null)
		{
			if (Equals(resnode.Info, note))
				return resnode;
			resnode = resnode.Next;
		}

		return null;
	}

	public bool Equals(Note note1, Note note2)
	{
		if ((note2.ID != -1 && note2.ID != note1.ID) || (note2.Title != "" && note2.Title != note1.Title) || (note2.Description != "" && note2.Description != note1.Description) || (note2.Type != "" && note2.Type != note1.Type) || (note2.Priority != -1 && note2.Priority != note1.Priority))
			return false;
		return true;
	}

	public void SelectionSort()
	{
		LIST list2 = new LIST();
		Node fakeHead = new Node();
		AddFirst(fakeHead);
		Node beforemin;
		Node node;
		while (head.Next != null)
		{
			beforemin = head;
			node = head.Next;
			while (node.Next != null)
			{
				//		if (node.Next.patient.Age < beforemin.Next.patient.Age)
				beforemin = node;
				node = node.Next;
			}

			Node temp = beforemin.Next;
			beforemin.Next = beforemin.Next.Next;
			list2.AddLast(temp);
		}

		head.Dispose();
		head = list2.Head;
		tail = list2.Tail;
	}

	public void QuickSort()
	{
		if (head == tail)
			return;
		LIST list1 = new LIST();
		LIST list2 = new LIST();
		Node pivot = head;
		Node temp;
		Node p = head.Next;
		while (p != null)
		{
			temp = p.Next;
			if (p.Info.Priority < pivot.Info.Priority)
				list1.AddLast(p);
			else
				list2.AddLast(p);
			p = temp;
		}

		list1.QuickSort();
		list2.QuickSort();
		if (!list1.IsEmpty())
		{
			head = list1.head;
			list1.tail.Next = pivot;
		}

		pivot.Next = list2.head;
		if (!list2.IsEmpty())
			tail = list2.tail;
		else
		{
			tail = pivot;
			tail.Next = null;
		}
	}

	public void Reverse()
	{
		/*	LIST listtemp = new LIST();
			Node temp;
			Node node = head;
			while (node != null)
			{
				temp = node;
				node = node.Next;
				listtemp.AddFirst(temp);
			}
			head = listtemp.Head;
			tail = listtemp.Tail;
			*/
		Node previous = null, current, next = null;
		current = head;
		while (current != null)
		{
			next = current.Next;
			current.Next = previous;
			previous = current;
			current = next;
		}

		tail = head;
		head = previous;
	}

	public void Classify()
	{
		if (head == tail)
			return;
		LIST list2 = new LIST();
		Node p = head;
		Node pre = head;
		Node temp;
		while (p != null)
		{
			if (p.Info.Type != head.Info.Type)
			{
				temp = p;
				p = p.Next;
				pre.Next = p;
				list2.AddLast(temp);
			}
			else
			{
				pre = p;
				p = p.Next;
			}
		}

		tail = pre;
		tail.Next = null;
		if (!list2.IsEmpty())
		{
			list2.Classify();
			tail.Next = list2.Head;
			tail = list2.Tail;
		}
	}
}

public class mainclass
{
	static void Main()
	{
	}
}

​x
 
public class Note
{
    public string Title
    {
        get;
        set;
    }
​
    public string Description
    {
        get;
        set;
    }
​
    public string Type
    {
        get;
        set;
    }
​
    public int Priority
    {
        get;
        set;
    }
​
    private int id;
    public int ID
    {
        get
        {
            return id;
        }
    }
​
    public Note(string title, string description, string type, int priority, int id)
    {
        Title = title;
        Description = description;
        Type = type;
        Priority = priority;
        this.id = id;
    }
}
​
public class Node
{
    public Note Info
    {
        get;
        set;
    }
​
    public Node Next
    {
        get;
        set;
    }
​
    public Node(Note note)
    {
        Info = note;
        Next = null;
    }
​
    public Node()
    {
        Info = null;
        Next = null;
    }
}
​
public class LIST
{
    private Node head;
    private Node tail;
    public Node Head
    {
        get
        {
            return head;
        }
    }
​
    public Node Tail
    {
        get
        {
            return tail;
        }
    }
​
    public LIST()
    {
        head = tail = null;
    }
​
    public bool IsEmpty()
    {
        return (head == null);
    }
​
    public void AddFirst(Node node)
    {
        if (IsEmpty())
        {
            head = tail = node;
            tail.Next = null;
        }
        else
        {
            node.Next = head;
            head = node;
        }
    }
​
    public void AddLast(Node node)
    {
        if (IsEmpty())
        {
            head = tail = node;
            tail.Next = null;
        }
        else
        {
            tail.Next = node;
            tail = node;
            tail.Next = null;
        }
    }
​
    public void AddNodeAfter(Node node1, Node node2)
    {
        node2.Next = node1.Next;
        node1.Next = node2;
        if (tail == node1)
        {
            tail = node2;
            tail.Next = null;
        }
    }
​
    public void AddNodeBefore(Node node1, Node node2)
    {
        AddNodeAfter(node1, node2);
        Note temp = node1.Info;
        node1.Info = node2.Info;
        node2.Info = temp;
    }
​
    public void RemoveFirst()
    {
        if (IsEmpty())
            return;
        if (head == tail)
        {
            head.Dispose();
            head = tail = null;
        }
        else
        {
            Node node = head.Next;
            head.Dispose();
            head = node;
        }
    }
​
    public void RemoveLast()
    {
        if (IsEmpty())
            return;
        if (head == tail)
        {
            tail.Dispose();
            head = tail = null;
        }
        else
        {
            Node node = head;
            while (node.Next != tail)
                node = node.Next;
            tail.Dispose();
            tail = node;
            tail.Next = null;
        }
    }
​
    public void RemoveAfter(Node node)
    {
        if (IsEmpty() || node == tail)
            return;
        Node nextNode = node.Next;
        node.Next = nextNode.Next;
        if (nextNode == tail)
        {
            tail = node;
            tail.Next = null;
        }
​
        nextNode.Dispose();
    }
​
    public void RemoveBefore(Node node)
    {
        if (IsEmpty() || head == node)
            return;
        if (head.Next == node)
            RemoveFirst();
        else
        {
            Node p = head;
            while (p.Next.Next != node)
                p = p.Next;
            RemoveAfter(p);
        }
    }
​
    //sua
    private void RemoveNode(Node node)
    {
        if (IsEmpty())
            return;
        else if (head == tail && head == node)
        {
            head = tail = null;
            node.Dispose();
        }
        else if (head == node)
        {
            head = node.Next;
            node.Dispose();
        }
        else
        {
            Node p = head;
            while (p.Next != node)
                p = p.Next;
            if (tail == node)
                tail = p;
            p.Next = node.Next;
            node.Dispose();
        }
    }
​
    public Node SearchNode(Note note)
    {
        Node resnode = head;
        while (resnode != null)
        {
            if (Equals(resnode.Info, note))
                return resnode;
            resnode = resnode.Next;
        }
​
        return null;
    }
​
    public bool Equals(Note note1, Note note2)
    {
        if ((note2.ID != -1 && note2.ID != note1.ID) || (note2.Title != "" && note2.Title != note1.Title) || (note2.Description != "" && note2.Description != note1.Description) || (note2.Type != "" && note2.Type != note1.Type) || (note2.Priority != -1 && note2.Priority != note1.Priority))
            return false;
        return true;
    }
​
    public void SelectionSort()
    {
        LIST list2 = new LIST();
        Node fakeHead = new Node();
        AddFirst(fakeHead);
        Node beforemin;
        Node node;
        while (head.Next != null)
        {
            beforemin = head;
            node = head.Next;
            while (node.Next != null)
            {
                //      if (node.Next.patient.Age < beforemin.Next.patient.Age)
                beforemin = node;
                node = node.Next;
            }
​
            Node temp = beforemin.Next;
            beforemin.Next = beforemin.Next.Next;
            list2.AddLast(temp);
        }
​
        head.Dispose();
        head = list2.Head;
        tail = list2.Tail;
    }
​
    public void QuickSort()
    {
        if (head == tail)
            return;
        LIST list1 = new LIST();
        LIST list2 = new LIST();
        Node pivot = head;
        Node temp;
        Node p = head.Next;
        while (p != null)
        {
            temp = p.Next;
            if (p.Info.Priority < pivot.Info.Priority)
                list1.AddLast(p);
            else
                list2.AddLast(p);
            p = temp;
        }
​
        list1.QuickSort();
        list2.QuickSort();
        if (!list1.IsEmpty())
        {
            head = list1.head;
            list1.tail.Next = pivot;
        }
​
        pivot.Next = list2.head;
        if (!list2.IsEmpty())
            tail = list2.tail;
        else
        {
            tail = pivot;
            tail.Next = null;
        }
    }
​
    public void Reverse()
    {
        /*  LIST listtemp = new LIST();
            Node temp;
            Node node = head;
            while (node != null)
            {
                temp = node;
                node = node.Next;
                listtemp.AddFirst(temp);
            }
            head = listtemp.Head;
            tail = listtemp.Tail;
            */
        Node previous = null, current, next = null;
        current = head;
        while (current != null)
        {
            next = current.Next;
            current.Next = previous;
            previous = current;
            current = next;
        }
​
        tail = head;
        head = previous;
    }
​
    public void Classify()
    {
        if (head == tail)
            return;
        LIST list2 = new LIST();
        Node p = head;
        Node pre = head;
        Node temp;
        while (p != null)
        {
            if (p.Info.Type != head.Info.Type)
            {
                temp = p;
                p = p.Next;
                pre.Next = p;
                list2.AddLast(temp);
            }
            else
            {
                pre = p;
                p = p.Next;
            }
        }
​
        tail = pre;
        tail.Next = null;
        if (!list2.IsEmpty())
        {
            list2.Classify();
            tail.Next = list2.Head;
            tail = list2.Tail;
        }
    }
}
​
public class mainclass
{
    static void Main()
    {
    }
}

View IL Code