Question

Hi, I need help writing a code for this. The language is python 3, and we cannot use things like break, continue, exit(), lambda, map, filter, raise, try, except, and assert in our code. Thank you!

Implement one of the sorting algorithms from class, either bubble, selection or quick sort with the following modification. Call the function "color_sort(the_list)"

Each element is now a list (or tuple) with two elements. The first element is the number value that you need to sort. The second is a "color" which is really a string.  

In case of a tie, sort the highest priority color forward of the lower priority colors.  

Heres the Color Hierarchy:

Gold - Highest

Red - Second

Blue - Third

Green - Fourth

A sample list to be sorted will be for instance:

[(3, 'red'), (2, 'blue'), (2, 'gold'), (5, 'green'), (17, 'blue')]

Sorted it will be:

[(2, 'gold'), (2, 'blue'), (3, 'red'), (5, 'green'), (17, 'blue')]

If there are all the same color, then it sorts just as a usual list would:

[(27, 'red'), (10, 'red'), (21, 'red'), (46, 'red'), (13, 'red')]

Sorted it is:

[(10, 'red'), (13, 'red'), (21, 'red'), (27, 'red'), (46, 'red')]

Colors will only be in those four categories, and in the list, will always be in lower case.  

We CANNOT use .sort(), because it results in a zero for the problem.  

Answer 1

PLEASE GIVE IT A THUMBS UP

nikhil@nikhil-Vostro-15-3568:-/Desktop/CODE$ python3 demo.py [(2, 'gold'), (2, 'blue'), (3, 'red'), (5, 'green'), (17, 'blue')] [(10, 'red'), (13, 'red'), (21, 'red'), (27, 'red'), (46, 'red')] nikhil@nikhil-Vostro-15-3568:-/Desktop/CODES

color = ["gold","red","blue","green"]

def color_sort(the_list):
   global color
   i=0
   while(i<len(the_list)):
       j=0
       while(j<len(the_list)):
           if(the_list[i][0] < the_list[j][0]):
               t = the_list[i]
               the_list[i] = the_list[j]
               the_list[j] = t
           elif(the_list[i][0] == the_list[j][0]):
               if(the_list[i][1] != the_list[j][1]):
                   if((the_list[i][1]==color[0] and the_list[j][1]==color[1]) or (the_list[i][1]==color[0] and the_list[j][1]==color[2]) or (the_list[i][1]==color[0] and the_list[j][1]==color[3])):
                       t = the_list[i]
                       the_list[i] = the_list[j]
                       the_list[j] = t
                   elif((the_list[i][1]==color[1] and the_list[j][1]==color[2]) or (the_list[i][1]==color[1] and the_list[j][1]==color[3])):
                       t = the_list[i]
                       the_list[i] = the_list[j]
                       the_list[j] = t
                   elif((the_list[i][1]==color[2] and the_list[j][1]==color[3])):
                       t = the_list[i]
                       the_list[i] = the_list[j]
                       the_list[j] = t
           j+=1
       i+=1

   return the_list

l = [(3, 'red'), (2, 'blue'), (2, 'gold'), (5, 'green'), (17, 'blue')]
l1 = [(27, 'red'), (10, 'red'), (21, 'red'), (46, 'red'), (13, 'red')]
print(color_sort(l))
print(color_sort(l1))

-/Desktop/CODE/demo.py (CODE) - Sublime Text (UNREGISTERED) File Edit Selection Find View Goto Tools Project Preferences Help х X FOLDERS CODE html node_modules cold.gif A cool.gif <> index.html /* main.js /* problem-2.css sun.png A thun.png warm.gif zero.jpg Project 1.jpg <> A.html /* A.java a.out /* B.java /* CoolString.cpp 6 data_keyword.sq date.dat /* demo.c /* demo.cpp demo.csv /* demo.py 1000 **BBB Bio 0300 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 demo.cpp X demo.c demo.py X A.java index.html problem-2.css X color = ["gold", "red", "blue", "green"] def color sort(the list): global color i=0 while(i<len(the_list)): j=0 while(j<len(the_list)): if(the list[i][0] <the_list[i][0]): t = the_list[i] the list[i] = the_list[j] the_list[i] - t elif(the_list[i][0] = the_list[j][0]): if(the_list[i][1] != the_list[i][i]): if(the list[i][1]=color[0] and the_list[i][1]==color[1]) or (the_list[i][1]=-color[0] and the list[j][1]=color[2]) or (the_list[i][1]==color[] and the_list[j][1= t = the_list[i] the list[i] = the_list[i] the list[j] = t elif((the_list[i][1]==color[1] and the_list[i][1]==color[2]) or (the_list[i][1]==color[1] and the list[j][1]=color[3])): t = the list[i] the_list[i] = the_list[i] the list[j] = t elif((the_list[i][1]=color[2] and the_list[i][1]=color[3])): t = the_list[i] the_list[i] = the_list[j] the list[i] = t j+=1 it=1 return the list 1 = [(3, 'red'), (2, 'blue'), (2, 'gold'), (5, 'green'), (17, 'blue')] u = [(27, 'red'), (10, 'red'), (21, 'red'), (46, 'red'), (13, 'red') print(color_sort(L)) print(color_sort (11) Line 36, Column 20 Tab Size: 4 Python