Fundamentals
Billy likes to keep all his number in an jar, however there's one special one that he likes to keep at the top of it. It turns out that Billy has accidentaly mixed up his jar, and he can't find his special number!
You must return a new array in which his special number is the first element. The arguments given to the function are as follows:
jar - All of Billy's numbers.
special - Billy's special number.
All original numbers in the resulting array must remain, it's only the order that's different.
If the array is empty or null, return nil, None, or null. You can assume special is in the array.
def find_special(jar, special):
# initial solution
if jar != None and jar != []:
for i in range(len(jar)):
if jar[i] == special:
jar.insert(0,jar.pop(i))
break
return jar
return Nonetest.assert_equals(find_special([0, 5, 100, 9, 4], 9), [9, 0, 5, 100, 4])
test.assert_equals(find_special([], 3), None)
test.assert_equals(find_special([4, 5, 6.5, 99, 12.2, 46], 6.5), [6.5, 4, 5, 99, 12.2, 46])
test.assert_equals(find_special(None, 1), None)
test.assert_equals(find_special([3], 3), [3])
test.assert_equals(find_special([87, 5], 5), [5, 87])