def Reverse_Unsorted_element(array):
iterated = 1
length_of_array = return_fun_count.count(array)
while (iterated != length_of_array):
print(array[-iterated])
iterated += 1
print(array[0])
def Return_array_in_reverse_order(array):
Reversed_array = []
iterated = 1
length_of_array = return_fun_count.count(array)
while (iterated != length_of_array):
Reversed_array.append(array[-iterated])
iterated += 1
Reversed_array.append(array[0])
return Reversed_array
def Largest_count_Ntime(a, max):
count = 0
i = 0
length = return_fun_count.count(a)
while (i != length):
if (a[i] == max):
count += 1
i += 1
return count
def Smallest_count_Ntimes(a, min):
count = 0
i = 0
length = return_fun_count.count(a)
while (i != length):
if (a[i] == min):
count += 1
i += 1
return count
def Compare_two_array_element(array1, array2):
flag = False
index = 0
check = 1
length_of_array1 = return_fun_count.count(array1)
while (index != length_of_array1):
if array1[index] not in array2:
check = 1
index += 1
if check == 1:
flag = True
return flag
def smallest_Num(a):
value_count = return_fun_count.count(a)
first_num = a[0]
Second_num = a[1]
if (first_num < Second_num):
min = first_num
else:
min = Second_num
i = 2
while (i != value_count):
if (a[i] < min):
min = a[i]
i += 1
return min
def Largest_Num(a):
value_count = return_fun_count.count(a)
first_num = a[0]
second_num = a[1]
if (first_num > second_num):
max = first_num
else:
max = second_num
i = 2
while (i != value_count):
if (a[i] > max):
max = a[i]
i += 1
return max