One, yesterday's content explained
Built-in functions: Focus on a few:
Max (*args,key=none)
Min (*args,key=none)
Zip (*args,key=none)
Sorted (*args,key=none,reverse=false)
Reversed () Flip returns an iterator
Filter (Key,*args)
Map (Key,*args)
anonymous function: Lambda x:x*x
Second, homework explanation
Third, today's content
Recursion:
Set recursion count: Import sys
Sys.setrecursionlimit ()
Recursion must have two conditions
1, must give him an end to the setting
2, and at the end of the time, can not return the function, to return an actual value, so as to make a good calculation
Binary search: Algorithm, the most classical and simplest algorithm
Premise: A sequence of numbers that must be ordered and not duplicated.
Four, weekend homework
So
Oldboy Seventeenth Day. I Love Python. God of all evils: recursion; Initial algorithm: two-point search;