Method printLL

Sorting Algorithims/quicksort_linkedlist.py:27–35

(self)

    # method to print the linkedlist
    def printLL(self) -> None:
        temp = self.head
        if temp == None:
            return "Linked List is empty"
        while temp.next:
            print(temp.data, "->", end="")
            temp = temp.next
        print(temp.data)
        return


# Partition algorithm with pivot as first element