public void sortListByNameSelection()
        {
                var current = head;
                // for i = 1 to size - 1
                for (var i = current; i.next != null; i = i.next)
                {
                    // for now, set min = i
                    Node min = new Node();
                        min.Surname = i.Surname;
                        min.Name = i.Name;

                // compare min to all other elements in unsorted subarray
                for (var j = i.next; j != null; j = j.next)
                {
                        // if you find an even smaller element, that is now min
                        if (min.Surname.CompareTo(j.Surname) > 0)
                        {

                            min.Surname = j.Surname;
                            min.Name = j.Name;

                        }
                }
                    Console.WriteLine("---------------------------");
                    // swap to put min in correct position
                    Node temp = new Node();
                    temp.Name = min.Name;
                    temp.Surname = min.Surname;

                    min.Surname = i.Surname;
                    min.Name = i.Name;

                    i.Surname = temp.Surname;
                    i.Name = temp.Name;

                    printAllNodes();
                }
        }