python中的排序算法帮助

Question

我一直在研究一个程序，该程序将从两个文件中获取信息，然后将信息按排序顺序写到单个文件中。

所以我所做的就是将文件的每一行作为元素存储在列表中。 我创建了另一个函数，该函数将每个元素拆分为2d数组，在其中我可以轻松访问名称变量。 从那里，我想创建一个嵌套的for循环，对其进行迭代，以检查数组中的最大值，从列表中删除该值，并将其附加到新列表中，直到有一个排序列表为止。

我想我大概90％都可以，但是我很难将排序算法的逻辑包住。 看来问题一直在变得越来越复杂，我一直想使用指针。 如果有人可以帮助您阐明这个问题，我将不胜感激。

import os
from http.cookiejar import DAYS
from macpath import split

# This program reads a given input file and finds its longest line.
class Employee: 
    def __init__(self, EmployeeID, name, wage, days):
        self.EmployeeID = EmployeeID
        self.name = name
        self.wage = wage
        self.days = days

def Extraction(file,file2):
    employList = [] 
    while True:
        line1 = file.readline().strip()
        line2 = file2.readline().strip()
        #print(type(line1))
        employList.append(line1)
        #print(line1)
        employList.append(line2)
        #print(line2)
        if line1 == '' or line2 == '':
            break
    return employList

def Sort(mylist):
    splitlist = []
    sortedlist = []
    print(len(mylist))
    for items in range(len(mylist)):

        #print(mylist[items].split())
        splitlist.append(mylist[items].split())
        print(splitlist)
    #print(splitlist[1][1])
    #print(splitlist[1][2])
    highest = "z"
    print(highest)
    sortingLength = len(splitlist)
    for i in range(10):
        for items in range(len(splitlist)-2):
            if highest > splitlist[items][2]:
                istrue = highest < splitlist[items][2]
                highest = splitlist[items][1]
                print(items)
                print(istrue)
                print('marker')
                print(splitlist[items][2])
            if items == (len(splitlist)-2):
                print("End of list",splitlist[items][2])

        print(highest)
        print(splitlist.index(highest))
    print(splitlist[len(splitlist)-1][2])
    print(sortingLength)

fPath = 'C:/Temp'

fileName = 'payroll1.txt'
fullFileName = os.path.join(fPath,fileName)
fileName2 = 'payroll2.txt'
fullFileName2 = os.path.join(fPath,fileName2)

f = open(fullFileName,'r')
f2 = open(fullFileName2, 'r')

employeeList = Extraction(f,f2)#pulling out each line in the file and placing into a list
Sort(employeeList)

ReportName= "List of Employees:"
marker = '-'* len(ReportName)
print (ReportName + ' \n' + marker)
total = 0

f.close()

我遇到一次有最大值尝试将其值附加到sortedlist，从拆分列表中删除该值并重新运行代码的问题。

Answer 1

根据Joran的建议，使用sorted方法要容易得多，并且已经内置。 我已经对您的阅读方法进行了编辑，以便它可以构建两个元组列表，分别代表行和行的长度。 sorted方法将返回一个根据键（行长）和降序排序的列表（ reverse=True ）

from operator import itemgetter

class Employee: 
    def __init__(self, EmployeeID, name, wage, days):
        self.EmployeeID = EmployeeID
        self.name = name
        self.wage = wage
        self.days = days

def Extraction(file,file2):
    employList = [] 
    mylines = [(i, len(l.strip()), 'file1') for i,l in enumerate(file.readlines())]
    mylines2 = [(i, len(l.strip()), 'file2') for i,l in enumerate(file2.readlines())]

    employList = [*mylines, *mylines2]

    return employList

fPath = 'C:/Temp'

fileName = 'payroll1.txt'
fullFileName = os.path.join(fPath,fileName)
fileName2 = 'payroll2.txt'
fullFileName2 = os.path.join(fPath,fileName2)

f = open(fullFileName,'r')
f2 = open(fullFileName2, 'r')

employeeList = Extraction(f,f2)#pulling out each line in the file and placing the line_number and length into a list

f.close()
f2.close()

# Itemgetter will sort on the second element of the tuple, len(line)
# and reverse will put it in descending order
ReportName = sorted(employeeList, key=itemgetter(1), reverse=True)

编辑：我在元组中添加了标记，以便您可以跟踪什么文件来自什么文件。 没有它们可能会造成混乱