Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import numpy as np
- def max_in_list(array):
- MAX = array[0]
- for i in array:
- if MAX < i:
- MAX = i
- return MAX
- def min_in_list(array):
- MIN = array[0]
- for i in array:
- if MIN > i:
- MIN = i
- return MIN
- def ABS(a):
- return (a**2)**(1/2)
- def f1(array):
- for i in range(len(array)-1):
- for j in range(len(array)-1-i):
- if ABS(array[j]) > ABS(array[j+1]):
- buff = array[j]
- array[j] = array[j+1]
- array[j+1] = buff
- return array
- def f2(array):
- buf = list()
- array2 = list()
- for i in range(len(array[0])):
- g = list()
- for j in range(len(array)):
- g.append(array[j][i])
- buf.append(max_in_list(g))
- array2.append(g)
- max_i = 0
- MAX = buf[0]
- for i in range(len(buf)):
- if buf[i] > MAX:
- MAX = buf[i]
- max_i = i
- ans = 0
- for i in range(len(array)):
- ans += array[i][max_i]
- return ans
- # Вопрос: четные по индексам или по порядку?
- # Предположим что нумерация строк начинается с 1
- def f3(array):
- for i in range(len(array)):
- for j in range(len(array[0])-1):
- if i % 2 == 0:
- break
- for k in range(len(array[0])-1-j):
- if array[i][k]<array[i][k+1]:
- buff = array[i][k]
- array[i][k] = array[i][k+1]
- array[i][k+1] = buff
- return array
- def f4(array):
- buf = list()
- array2 = list()
- for i in range(len(array[0])):
- g = list()
- for j in range(len(array)):
- g.append(array[j][i])
- buf.append(max_in_list(g))
- array2.append(g)
- for i in range(len(buf)-1):
- for j in range(len(buf)-1-i):
- if buf[j]<buf[j+1]:
- buff = buf[j]
- array_buff = array2[j]
- buf[j] = buf[j+1]
- array2[j] = array2[j+1]
- buf[j+1] = buff
- array2[j+1] = array_buff
- ans = list()
- for i in range(len(array2[0])):
- g = list()
- for j in range(len(array2)):
- g.append(array2[j][i])
- ans.append(g)
- return np.array(ans)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement