We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 43b98e8 commit be6c145Copy full SHA for be6c145
exercises/08.2-Divide_and_conquer/solution.hide.py
@@ -2,17 +2,16 @@
2
3
# Your code here
4
def sort_odd_even(numbers):
5
- odd = []
+ sorted_list = []
6
even = []
7
8
for i in numbers:
9
if (i % 2 == 1):
10
- odd.append(i)
+ sorted_list.append(i)
11
elif (i % 2 == 0):
12
even.append(i)
13
14
- sorted_numbers = [odd, even]
15
-
16
- return sorted_numbers
+ sorted_list.extend(even)
+ return sorted_list
17
18
print(sort_odd_even(list_of_numbers))
0 commit comments