GCK/ linear search

from random import randint


my_list=[randint(0,1000) for i in range(100)]
my_list2=[190, 496, 165, 371, 317, 307, 990, 303, 35, 598, 546, 969, 774, 418,
          855, 956, 340, 578, 639, 417, 225, 741, 579, 227, 414, 112, 252, 254,
          637, 295, 324, 408, 601, 831, 767, 340, 193, 38, 498, 95, 39, 690,
          920, 321, 74, 80, 878, 728, 381, 28, 558, 477, 405, 311, 216, 820,
          85, 95, 884, 425, 927, 471, 586, 690, 1000, 169, 899, 48, 661, 522,
          130, 379, 948, 459, 999, 263, 62, 182, 663, 533, 84, 110, 360, 974,
          95, 763, 728, 622, 500, 337, 693, 320, 864, 107, 77, 103, 776, 981,
          625, 350]

#print(len(my_list2))
def linear_search(my_list,value):
    count=0
    position_list=[]

    for i in range(len(my_list)):

        if my_list[i]==value:
            count+=1 # if value is several times there
            position_list.append(i)
    print("item {} is at position(s) {} thus is found {} time(s)".format(value,position_list, count))
    return position_list

    if len(position_list)==0:
        return False


search=linear_search(my_list2,95)
print(search)

search2=linear_search(my_list,5)
print(search2)