GitHub_collection_Python/maths/average.py

def average(nums):
    sum = 0
    for x in nums:
      sum += x
    avg = sum / len(nums)
    print(avg)
    return avg

def main():
  average([2, 4, 6, 8, 20, 50, 70])

if __name__ == '__main__':
  main()
Editing base64, Adding average file, Editing find_lcm (#673) * avrage.py calculate and print the avrage of number list. * Update base64_cipher.py encoding and decoding base64 without any module. * Update and rename avrage.py to average.py * update find_lcm algorithm I made find_lcm more efficient form O(num1*num2) to O(min{num1,num2}). 2019-01-19 22:49:06 +02:00			`def average(nums):`
			`sum = 0`
			`for x in nums:`
			`sum += x`
Update average.py (#908) Reduced lines of code and extra processing on the line: n += 1 2019-06-22 05:42:28 +01:00			`avg = sum / len(nums)`
Editing base64, Adding average file, Editing find_lcm (#673) * avrage.py calculate and print the avrage of number list. * Update base64_cipher.py encoding and decoding base64 without any module. * Update and rename avrage.py to average.py * update find_lcm algorithm I made find_lcm more efficient form O(num1*num2) to O(min{num1,num2}). 2019-01-19 22:49:06 +02:00			`print(avg)`
Update average.py (#908) Reduced lines of code and extra processing on the line: n += 1 2019-06-22 05:42:28 +01:00			`return avg`
Editing base64, Adding average file, Editing find_lcm (#673) * avrage.py calculate and print the avrage of number list. * Update base64_cipher.py encoding and decoding base64 without any module. * Update and rename avrage.py to average.py * update find_lcm algorithm I made find_lcm more efficient form O(num1*num2) to O(min{num1,num2}). 2019-01-19 22:49:06 +02:00
			`def main():`
			`average([2, 4, 6, 8, 20, 50, 70])`

			`if __name__ == '__main__':`
			`main()`