CODEWITHSUNDEEP
pythonlistsortingpython-3.5
ConSod
ConSod

Reputation: 801

Sort a list of lists based on an if/else condition

I need to sort a list containing nested lists based on a condition. The condition is: if first index is 0, sort on index nr 7. Then if second index is 0, sort on index nr 8. So the below list (unsorted):

[[11, 37620, 'mat', 'xxx', 1, 28.5, 0, 11, 37620, 'Arp', 'xxx', 1, 28],
 [10, 24210, 'Skatt', 'xxx', 2, 40, 0, 0, 0, 0, 0, 0, 0],
 [10, 37010, 'test, a', 'xxx', 5, 36.75, 0, 10, 37010, '', 'xxx', 7, 50.75],
 [0, 0, 'mottagare', 'xxx', 3, 20.25, 0, 10, 21511, 0, 0, 0, 0],     
 [10, 40000, 'eld', 'xxx', 5, 30.5, 0, 10, 40000, 'Oly', 'xxx', 5, 30],
 [10, 17060, 'bok', 'xxx', 1, 28.5, 0, 0, 0, 0, 0, 0, 0]]

Should look like this:

[[10, 17060, 'bok', 'xxx', 1, 28.5, 0, 0, 0, 0, 0, 0, 0],
 [0, 0, 'mottagare', 'xxx', 3, 20.25, 0, 10, 21511, 0, 0, 0, 0],
 [10, 24210, 'Skatt', 'xxx', 2, 40, 0, 0, 0, 0, 0, 0, 0],
 [10, 40000, 'eld', 'xxx', 5, 30.5, 0, 10, 40000, 'Oly', 'xxx', 5, 30],     
 [10, 37010, 'test, a', 'xxx', 5, 36.75, 0, 10, 37010, '', 'xxx', 7, 50.75],
 [11, 37620, 'mat', 'xxx', 1, 28.5, 0, 11, 37620, 'Arp', 'xxx', 1, 28]]

I have tried with a_list.sort(key = itemgetter(0)) and lambda, but the zero's always end up first. I have solved this by bubble sort, but it is awfully slow already with 6000 elements in the lists. I paste the bubblesort below for reference. The list zero values are originally None, but for sorting in Python 3 I have converted them to int 0.

the_list_pos = 0
for key, value in kund_dict2.items():
    # Start sorting from the whole list, since the_list_pos is zero
    for passnum in range(len(komplett_lista)-1,the_list_pos,-1):
        # Loop the list, one by one
        for i in range(passnum):
            # If these helper variables are None at the end, nothing happens
            comp1 = None
            comp2 = None
            # Check that the variables to compare are not None, and set them to appropiate values
            if komplett_lista[i][0] is not None and komplett_lista[i][0] == key:
                comp1 = komplett_lista[i][1]
            elif komplett_lista[i][7] is not None and komplett_lista[i][7] == key:
                comp1 = komplett_lista[i][8]   
            if komplett_lista[i+1][0] is not None and komplett_lista[i+1][0] == key:
                comp2 = komplett_lista[i+1][1]
            elif komplett_lista[i+1][7] is not None and komplett_lista[i+1][7] == key:
                comp2 = komplett_lista[i+1][8]
            # Do the actual sorting
            if comp1 is not None and comp2 is not None:    
                if comp1 > comp2:
                    temp = komplett_lista[i]
                    komplett_lista[i] = komplett_lista[i+1]
                    komplett_lista[i+1] = temp
    # update the position so that we do not sort over the already sorted data
    the_list_pos += (value)

Upvotes: 0

Views: 5670

Answers (1)

thebjorn
thebjorn

Reputation: 27311

Write a function to contain your logic for finding which column to sort on:

def sort_col_value(row):
    # if first index is 0, sort on index nr 7. 
    if row[0] == 0:
        return row[7]
    # Then if second index is 0, sort on index nr 8
    if row[1] == 0:
        return row[8]
    return row[0]

then use this function as the key parameter:

mylist.sort(key=sort_col_value)

Upvotes: 2

Related Questions