Question

Write a Python function to implement the quick sort algorithm over a singly linked list. The input of your function should be a reference pointing to the first node of a linked list, and the output of your function should also be a reference to the first node of a linked list, in which the data have been sorted into the ascending order. (You may use the LinkedQueue class we introduced in the lecture directly in your program.)

Answer 1

Please please thumbs up!!!

Hope it will help uh ouT!!!!!!

Code ::

(IN PYTHON LANGUAGE)

-----------------------------------------

class LinkedList:

class _Node:

def __init__(self, newData, newNext):

self._data = newData

self._next = newNext

  

def __init__(self):

self.__head = None

self.__size = 0

def __len__(self):

return self.__size

def is_empty(self):

return self.__size == 0

def remove(self, _data):

if(self.is_empty()):

print('List is empty.')

return

current = self.__head

prev = None

while current != None and current._data != _data:

prev = current

current = current._next

if current == None:

return

if prev == None:

self.__head = current._next

else:

prev._next = current._next

self.__size -= 1

def add(self, e):

new_node = self._Node(e, None)

if self.__head == None:

self.__head = new_node

else:

current = self.__head

while current._next != None:

current = current._next

current._next = new_node

self.__size += 1

def outputList(self):

if(self.is_empty()):

print('List is empty.')

return

current = self.__head

while current != None:

print(current._data, end = ' ')

current = current._next

print()

# quick_sort() function implementation

def quick_sort(self):

if self.__head is None:

return None

last = self.__head

while last != None and last._next != None:

last = last._next

first, last = self.quick_sort_helper(self.__head, last)

last._next = None

self.__head = first

def quick_sort_helper(self, first, last):

if first is not last:

first_prev, last_prev, first_ref, last_ref, first_next, last_next = self.partition(first, last)

if first_prev is None:

first = first_ref

else:

first_prev, last_prev = self.quick_sort_helper(first_prev, last_prev)

first = first_prev

last_prev._next = first_ref

if first_next is None:

last = last_ref

else:

first_next, last_next = self.quick_sort_helper(first_next, last_next)

last_ref._next = first_next

last = last_next

return first, last

def partition(self, first, last):

temp_node = last

first_ref, last_ref = temp_node, temp_node

first_prev, last_prev, first_next, last_next = None, None, None, None

dummy_node = self._Node(None, None)

dummy_node._next = first

current = dummy_node

while current._next is not last:

current = current._next

if current._data > temp_node._data:

if first_next is not None:

last_next._next = current

last_next = current

else:

first_next = current

last_next = current

elif current._data < temp_node._data:

if first_prev is not None:

last_prev._next = current

last_prev= current

else:

first_prev = current

last_prev = current

else:

last_ref._next = current

last_ref = current

return first_prev, last_prev, first_ref, last_ref, first_next, last_next

# main() function implementation

if __name__ == '__main__':

# create an _data for LinkedList class

myList = LinkedList()

  

# call add() function

myList.add(78)

myList.add(69)

myList.add(25)

myList.add(45)

myList.add(35)

myList.add(75)

# call outputList() function

print("List before sorting: ", end = '')

myList.outputList()

# call quick_sort() function

myList.quick_sort()

# call outputList() function

print("List after sorting: ", end = '')

myList.outputList()

---------------------------------------

Output ::

0 % -/Desktop/CODE/demo.py (CODE) - Sublime Text (UNREGISTERED) File Edit Selection Find View Goto Tools Project Preferences Help X Scores. x demo.py demo.cpp X Scores.cpp class Linkedlist: class Node: definit__(self, newData, new ext): self data = newData self. next = newNext der init (self): self. head = None self size def len (self): return self._size def is empty(self): return self size = 0 warm.gif A zero.jpg myPack Project 1.jpg 1.mp4 5 * A.java a.out b.bin /* B.java /* CheckingAccoun TE Data.CS.SFSU.tx datal.dat data2.dat data.dat data_keyword.sc date.dat /demo.c /* demo.cpp / demo.py /* demo.sh E Encrypt.txt filel.npy file2.npy gr 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 def remove(self. data): if(self.is empty(): print('list is empty') return current = self._head prev = None while current != None and current. data != data: prev = current current = current_next if currentNone: return if prev = None: self._head - current__next else: prev. _next - current._next self size = 1 def add(self, e): new_node = self. Node(e, None) if self. head = None: self head - new node else: current = self. head while current. next != None: current = current. next current next new node self size = 1 def outputList(self): Line 113, Column 81 Spaces: 4 Python

e X -/Desktop/CODE/demo.py (CODE) - Sublime Text (UNREGISTERED) File Edit Selection Find View Goto Tools Project Preferences Help warm.gif demo.cpp Scores.cpp Scores. x demo.py A zero.jpg 45 def outputList(self): 46 1 (self.isempty(): myPack 47 print("List is empty.) 48 return Project 49 50 current = self. head 1.jpg 51 while current None: 1.mp4 52 print(current data, end 53 current -current. next 5 54 print() 55 * A.java 56 # quick sort() function implementation 57 def quick sort(sele): a.out 58 if self. head is None: b.bin 59 return None 60 /* B.java 61 last = self. head 62 while last != None and last. next != None: /* CheckingAccoun 63 last-last. _next 64 TE Data.CS.SFSU.tx 65 first, last = self.quick_sort helper(self._head, last) E datal.dat 66 last next = None 67 self. head = first data2.dat 68 69 def quick_sort_helper(self, first, last): data.dat 70 if first is not last: 71 first prev, last_prev, first_ref, last_ref, first_next, last_next = self.partition(first, last) data_keyword.sc 72 if first prev is None: date.dat 73 first = first ref 74 else: /demo.c 75 first_prev, last_prev - self.quick_sort_helper (first prev, last_prev) 76 first = first prev /* demo.cpp 77 last prev next = first ref 78 if first next is None: / demo.py 79 last = last ref /* demo.sh 80 else: 81 first_next, last_next = self.quick_sort_helper (first_next, last_next) E Encrypt.txt 82 last ref next = first next 83 last = last next filel.npy 84 return first, last 85 file2.npy 86 def partition(self. first, last): 87 temp_node - last gr 88 first ref, last ref - temp node, temp node 89 first prev, last prev, first next, last next = None, None, None, None Line 113, Column 81 Spaces: 4 Python

e --/Desktop/CODE/demo.py (CODE) - Sublime Text (UNREGISTERED) File Edit Selection Find View Goto Tools Project Preferences Help demo.py demo.cpp X Scores.cpp X Scores.h x first prev, last prev, first next, last next = None, None, None, None 89 90 91 92 93 94 95 96 97 98 99 warm.gif zero.jpg myPack Project 1.jpg 1.mp4 5 * A.java a.out b.bin /* B.java /* CheckingAccoun TE Data.CS.SFSU.tx E datal.dat data2.dat data.dat data_keyword.se date.dat /demo.c /* demo.cpp / demo.py /* demo.sh E Encrypt.txt filel.npy file2.npy gr dummy_node - self. Node (None, None) dummy_node_next = first current = dummy node while current. next is not last: current = current. next if current._data > temp_node_data: if first next is not None: last next next = current last next = current else: first next = current last next = current elif current data < temp_node_data: if first prev is not None: last prev._next = current last prev= current else: first_prev = current last prev - current else: last ref. next = current last ref - current return first prev, last_prev, first_ref, last_ref, first_next, last next 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 name # main() function implementation 17 = 'main': # create an data for LinkedList class myList - LinkedList() #call add() function myList.add(78) myList.add(69) myList.add(25) myList.add(45) myList.add(35) myList.add(75) #call outputList() function print("List before sorting: ", end = '') myList.outputList() #call quick sort() function Line 113, Column 81 Spaces: 4 Python

# call quick sort() function myList.quick_sort() 132 133 134 135 136 137 138 # call outputList() function print("List after sorting: ", myList.outputList() end = '')

nikhil@nikhil-Vostro-15-3568: -/Desktop/CODE File Edit View Search Terminal Help nikhil@nikhil-Vostro-15-3568:-/Desktop/CODE$ python3 demo.py List before sorting: 78 69 25 45 35 75 List after sorting: 25 35 45 69 75 78 nikhil@nikhil-Vostro-15-3568:-/Desktop/CODES I