aboutsummaryrefslogtreecommitdiff
path: root/challenge-040/paulo-custodio/python/ch-2.py
blob: be8c13cdc3feeab45fc18bf09b63e24560de4c2e (plain)
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
#!/usr/bin/env python3

# Challenge 040
#
# TASK #2
# Sort SubList
# You are given a list of numbers and set of indices belong to the list.
# Write a script to sort the values belongs to the indices.
#
# For example,
#
# List: [ 10, 4, 1, 8, 12, 3 ]
# Indices: 0,2,5
# We would sort the values at indices 0, 2 and 5 i.e. 10, 1 and 3.
#
# Final List would look like below:
#
# List: [ 1, 4, 3, 8, 12, 10 ]

data = [10, 4, 1, 8, 12, 3]
indices = [0,2,5]

def sort_sublist(data, indices):
    values = []
    for i in indices:
        values.append(data[i])
    values.sort()
    for i in indices:
        data[i] = values.pop(0)
    return data

data = sort_sublist(data, indices)
print("["+(", ".join([str(x) for x in data]))+"]")