Write a sorting algorithm for a numerical dataset in Python.

Question

Anónimo · Accepted Answer

def mergeSort(lst): split = len(lst) / 2 left = lst[:split] right = lst[split:] if len(left) > 1 or len(right) > 1: left = mergeSort(left) right = mergeSort(right) return merge(left, right) def merge(A, B): i=0 j=0 sorted_list = [] while i < len(A) and j < len(B): if A[i] <= B[j]: sorted_list.append(A[i]) i += 1 else: sorted_list.append(B[j]) j += 1 if i < len(A): sorted_list.extend(A[i:]) elif j < len(B): sorted_list.extend(B[j:]) return sorted_list

Idan · Answer

list = ["1", "4", "2", "10", "5"]
list = [ int(i) for i in list ]
list.sort()
print (list)

SAR662 · Answer

Here's a bubble sort:


number_set = [1, 4, 3, 7, 3, 4, 5, 2, 8, 4]
print "This UNSORTED set has %d elements and is: " % len(number_set), number_set

for x in range(len(number_set)):
   for y in range(x, len(number_set)):
        if number_set[x] >= number_set[y]:
            continue
        else:
            t = number_set[x]
            number_set[x] = number_set[y]
            number_set[y] = t
            print "swapped and the set is now: ", number_set
print "This SORTED set has %d elements and is: " % len(number_set), number_set

Anónimo · Answer

def mysort(arr):
    if len(arr)  pivot]
    return mysort(left) + middle + mysort(right)

Idan · Answer

list = ["1", "4", "2", "10", "5"]    
list = [ int(i) for i in list ]     
list.sort()     
print (list)

Anónimo · Answer

def mysort(arr):
    if len(arr)  pivot]
    return mysort(left) + middle + mysort(right)

Anónimo · Answer

def mysort(arr):
    if len(arr)  pivot]
    return mysort(left) + middle + mysort(right)

Anónimo · Answer

sorted_list = [ ]
loops = len(unsorted_list)
i = 0
while i <= loops:
    next_value = min(unsorted_list)
    sorted_list.append(unsorted_list.pop(unsorted_list.index(next_value)))
    i += 1

Meta

Pregunta de entrevista de Meta

Respuestas de entrevistas

Empresas seguidas

Búsquedas de empleo