本文共 975 字,大约阅读时间需要 3 分钟。
python二分法查找程序
Input N integer numbers and we have to find the maximum even number.
输入N个整数,我们必须找到最大的偶数。
There are many ways of doing this but this time, we have to thought of most computationally efficient algorithm to do so.
有很多方法可以做到这一点,但是这一次,我们必须考虑到计算效率最高的算法。
# Python code to find the maximum EVEN number n = 0 # loop counternum = 0 # to store the inputmaxnum = 0 # to store maximum EVEN number# loop to take input 10 numberwhile n<10: num = int(input("Enter your number: ")) if num%2 == 0: if num > maxnum: maxnum = num n += 1# printing the maximum even numberprint("The maximum EVEN number :",maxnum)
Output
输出量
Enter your number: 100Enter your number: 222Enter your number: 12Enter your number: 333Enter your number: 431Enter your number: 90Enter your number: 19Enter your number: 56Enter your number: 76Enter your number: 671The maximum EVEN number : 222
翻译自:
python二分法查找程序
转载地址:http://rttzd.baihongyu.com/