ascending_descending

def sort_mylist_asc(a):
  for my_number in range(len(a)-1,0,-1):
    for i in range(my_number):
      if a[i]>a[i+1]:
          temp = a[i]
          a[i] = a[i+1]
          a[i+1] = temp
  return a

def sort_mylist_desc(a):
	for desc in range(len(a)-1,0,-1):
		for i in range(desc):
			if a[i]<a[i+1]:
				des = a[i+1]
				a[i+1] = a[i]
				a[i] = des
	return a

def re_arrange(a):
	arr_re = []

	# sort the array
	arr = sort_mylist_asc(a)

	# slice the array into two

	arr_first = arr[0:int((len(arr)+1)/2)]

	arr_second = arr[int((len(arr)+1)/2):]


	# PUt the first half into the rearraged array

	arr_second = sort_mylist_desc(arr_second)
	# Take the second half

	arr_re = arr_first + arr_second

	return arr_re

# the latest result to the rearranged array





a = [54,26,93,17,77,31,44,44,55,20,-76,-56]

print(re_arrange(a))
print(re_arrange(a[1:-1]))