Method Sort

Sorting Algorithms/Sorting_List.py:21–33

(self)

        current.next = new_node

    def Sort(self):
        temp = self.head
        while temp:
            minn = temp
            after = temp.next
            while after:
                if minn.data > after.data:
                    minn = after
                after = after.next
            key = temp.data
            temp.data = minn.data
            minn.data = key
            temp = temp.next

    def Display(self):
        temp = self.head