Generators in Python || Python Tutorial || Learn Python Programming
Vložit
- čas přidán 24. 10. 2021
- 𝙎𝙩𝙖𝙮 𝙞𝙣 𝙩𝙝𝙚 𝙡𝙤𝙤𝙥 𝙄𝙉𝙁𝙄𝙉𝙄𝙏𝙀𝙇𝙔: snu.socratica.com/python Learn how to use generators in Python. We'll cover two types: Generator Functions and Generator Expressions. Generator functions use the "yield" keyword, while generator expressions look like a "tuple comprehension." Generators are a powerful and efficient tool for use when looping over large amounts of data.
We were able to bring you this video thanks to our generous Kickstarter backers! Find their names hidden (okay, not very hidden) in the video!
Socratica Friends, we have a quiet little email group for Python if you'd like to receive updates (can't count on YT for notifications). Sign up here: snu.socratica.com/python
⧓⧓⧓⧓⧓
Subscribe to Socratica + bell for notifications:
bit.ly/SocraticaSubscribe
Find our programming playlists here:
Python programming: bit.ly/PythonSocratica
SQL programming: bit.ly/SQL_Socratica
⧓⧓⧓⧓⧓
We recommend:
How to Be a Great Student
ebook: amzn.to/2Lh3XSP
Paperback: amzn.to/3t5jeH3
Kindle Unlimited (read free): amzn.to/3atr8TJ
Python Cookbook, 3rd edition
amzn.to/3goRmbG
The Mythical Man Month - Essays on Software Engineering & Project Management
amzn.to/2tYdNeP
Shop Amazon Used Textbooks - Save up to 90%
amzn.to/2pllk4B
⧓⧓⧓⧓⧓
Join this channel to get access to perks:
/ @socratica
Support Socratica on Patreon:
/ socratica
⧓⧓⧓⧓⧓
Python instructor: Ulka Simone Mohanty (@ulkam on Twitter)
Written & Produced by Michael Harrison
#Python #Generators #Coding
Wear a Socratica Python shirt for good luck coding: shop.socratica.com/products/python-by-socratica
Noice 👍
I look forward to contributing to the acquisition of a human
We know they're out there!! 💜🦉
FINALLY! Another python tutorial
To speed up the prime generator, don't add 2 to cache, because all numbers tested are odd and therefore compare false. In the inner loop between line 13 and 14, break if n < p*p - this will have the biggest speedup, because it will only check up to the sqrt of n. So 3 would be added without checks, 5 through 9 will only compare against the number 3. 11 through 25 only using numbers 3 and 5. Etc. vs using all of the numbers in the cache to find each new prime.
I've been watching your videos for about 5 years now and I just want to let you know that I now have a great full-time job as a consultant and am invaluable to my team thanks to my ability to code, which in part is thanks to you!
I got a question. I got an unusual tech Stack and don't know what position I should be submitting to. I know how to code in python mainly scraping, organizing data, sending API requests, formatting texts. I also know SEO, copywriting, creating websites and also 3D modelisation and motion graphics. I'm good at all what I mentioned.
@@skwerone Hi,
You're currently in the same path that I am.. Just saying.
We are searching the same things ( Probably more people than we think are trying )
I'm now speaking Python, and wish to find people to speak with.
If you want, respond me back, I use selenium with tkinter GUI strap in a beautiful OOP structure,
You'll understand.
Kindly, Guillaume. ( William )
@@skwerone can't anyone tell you what to do. Learn who you are and what you love to do then research multiple roles. I can cook but that doesn't mean I want to be a chef.
I've learnt so much from your videos; they are as informative as they are fun. Thanks so much!
No programing tutorial channel has such well written and engaging videos.
These videos are absolutely brilliant.I like the format, short easily digestible videos on a very specific feature of python.
Those python videos and their slightly different approach are always crystal clear and interesting. Thank you very much for your work!
A similar Haskell tutorial would be both a challenge for Socratica and a valuable source of knowledge for those who want to learn the language.
You can "stay in the Python loop" by signing up for our Python newsletter: snu.socratica.com/python
All I have to say that those python videos from your channel are best. Would you make a complete course laylist from beginner to advanced. Some time it feels like you made it because you get pleasure frome it. Thank You for your efforts.
I've known Socratica with the excellent abstract algebra videos, glad to see that the Python series is just as good!
So happy I found your channel. Great video...I like your approach to teaching and how you break things down and provide several examples. The information provided has greatly improved my understanding!
Never was so much owed by so many to so few for so short but so informative videos.
💜🦉
I didn't even know that there were Python features like generator expressions! Thank you Socratica!
I had never considered generating generators, but if I generate any ideas I will iterate until I return a tractable solution. Thanks for the video. I appreciate the ones that are aimed higher than beginner level!
embedded humor in these videos is proportional to the love they cook them with 🥰
that patreon addition was real smoooth!
very infomative nonetheless. did expect yield with somewhere cause i stagger there
Shit since I started python i've never understood generators like this, it's amazing that we have Socratica to be honest thank you so freaking much
I'm pretty new to python and I'm trying to learn more about the language. This video was super well done and easy to understand, and I learned exactly what I wanted to. Also that circuit board dress is so cool!
this is the best video I've watched about generators! such an important but somehow slippery concept to explain
I really enjoy the way these are presented. Clear and informative too.
I wanted this video like a month ago! Great job and a bunch of thanks!
best artificial intelligence visualization in the world.
Thanks for the tutorial )
Always great tutorials from this channel. Really appreciated
Thanks!
Thank you for your support, kind Socratica Friend!! 💜🦉
welcome back !!
waiting for more python tutos...
so much love from Myanmar🤍🤍🤍
Hello to our Socratica Friends in Myanmar!! 💜🦉
Thank You AI Teacher... Now iam Confident enough in dealing with python generator 😃❤
Very helpful video and the style is hilarious. love it! Subscribed
I'm not a noob in programming, but i was strugle to understand yield in functions. Thanks to you all is clear now!
This is wonderful to read, thank you for telling us! 💜🦉
It's odd isn't it, with programming someone will say the right words or use the right analogy for it to make sense. That table Tennis analogy is great!
Awesome video, didn't know about generators. Thanks!
seriously these videos are on another level..
Learning a lot from you folks. Thank you.
It seems some knowledge was generated in my head :)
I am very happy to see you again with another amazing video. thank you very much
Your videos really are the best - I have watched them over and over again as they are as entertaining as they are educative. Really really learned a lot. Thank you thank you for all the work you put into creating this masterpiece (officially my favorite videos on coding hands down!)
One quick ask, if you'll indulge me - could you possibly make something on Linked Lists, Binary Trees (in that order). Seen so much content on these but I bet hearing it from you would make it that much easier to digest/understand. Looking forward to this.
OMG ! Thanks alot! Clearer, it could not be ! 🙏
Never knew about the generator expression. Thanks!
Love and learnt so much from your videos,
Want videos on Multithreading, multiprocessing, Class and static methods, public private and protected methods, super keyword.
Thank you..always looking forward to the next video....
I've learned so much from this channel
Great Video …. Thanks …. I learn python from your videos
Awesome and helpful video! Great work 🥰
Generators in Python
generating interest.
The amount of education in Socratica's videos
Is indeed intense.
Expense
-s seem,
Like what they have a lot.
Let's help them out
And give it a thought.
Bot,
Is what they're not using.
Care,
Is what they give.
If they kept making videos till the end of time,
Then knowledge would always live!
I always love this series!
Happy to see you again
Good to see "Ulka Mohanty", the robotic actor
willing to admit Ulka is half the reason I watch these...
What a sense of humour...love it 😆
Instead of using a sentinel value in the inner for loop of the prime generator, you can use the `for ... else` construction. It's relatively unknown but it's perfect for this
I like the humor in these videos.
The prime generator will be way more efficient, if you only check until the square root of n is reached.
yeah, that would be a big speed up. Also (this wont really have any effect) you don't need 2 in the prime_cache as every number you are testing is odd
This was covered in an earlier video in the series.
Why do you call close() method instead using break in order to stop the for loop?
I've missed these tutorials
Great vid, a lot of fun.
Another great python tutorial. You should develop another way to accept financial support. I know someone is taking a big cut somewhere and I'd rather not give them anymore right now.
Oh, she's back!
This is actually impressive
Thanks for the video, it is great!
This is fantastic!
Great video. Thanks
I would like to compliment the presenter, thank you.
This is so good!
How to speed up:
1. Don't put 2 into the cache, because iterating 3 by 2 never results in an even number
2. Use the fact that all prime numbers greater than 3 are congruent to 1 or 5 mod 6 (you can massively speed up)
3. Only iterate up to square root of (n) when checking for primeness
This will give you a massive speedup.
Can you please explain point number 2 and 3.
@@hackerxxspacex6935
Of course.
Ad 2):
All prime numbers > 3 are either 6k+1 or 6k-1 where k is a natural number.
Examplea:
7 = 6 * 1 + 1
11 = 6 * 2 - 1
It's important though that of course not all numbers of one of those forms are prime, but you can exclude a large portion of the natural numbers from the division (actually: modulo) testing. I also use this to unroll my loop when I need a quick and dirty prime number test, because I do loop = loop + 6 and then the two divisions (sieving only requires prime numbers as divisors).
Saying they are congruent to either 1 or 5 mod 6 is the same sentence, just shorter.
Oh, and also I do a preliminary check if n mod 6 is either 1 or 5 to weed out many n before even starting to loop. Thats helpful, too.
Ad 3):
If you want to test n for primeness you only need to do division testing up to the square root of n (sqrt(n)) because sqrt(n) * sqrt(n) is already n.
Got a bit late, was so tired lately
How's Socratica💝
LOVE YOUR WORK!!!
Great video!
This is gold!
To answer the question weighing on everyone's mind, it is possible to create a generator that generates generators:
import itertools
def gens():
yield itertools.count(1, 5)
yield itertools.count(10, 3)
yield itertools.count(20, 2)
for gen in gens():
for x in gen:
print(x)
if x > 30:
break
this footage is awesome
Good job, ❤️from india
Excellent
ME: Another great lesson, what can you say about this?
PYTHON: Hissssssss!
How did a python turn into a hydra? Generators!
I recently found out about the "yield from" expression. You can use it to create generators with a recursive definition.
very nice!
i hope you create a machine learning tutorials using python. that would be awesome.. and math for machine learning separated playlist
Very nice.
I love this channel
another awesome!
I'd like to see an Assembly Tutorial from this channel!
What is Assembly used for these days? I thought C replaced Assembly
@@theblindprogrammer It can be used for a lot of things, especially when you are designing your own ISA...
I remember computerphile did something like this on yield primes:
def nats(n:int=2) -> int:
"""Natural numbers."""
while True:
yield n
n += 1
def sieve(s):
n = next(s)
yield n
yield from sieve(i for i in s if i % n != 0)
primes = sieve(nats())
MAX = 1000
for number in primes:
print(number)
if number > MAX:
break
but recursion limit breaks it with higher MAX value
maybe instead of looping over the primes in primecache you can define a variable fact=2 before the first loop, that will contain (n-1)! Than to check if n is prime we check weather (fact+1)%n==0, and to get the next factorial we need to multiply fact by n(n+1).
A small optimization for the generation of prime numbers: instead of storing the found ones in a list, you could put them in a set.
I’m curious, why would this improve performance?
@@stuarthys9879 It is much quicker to look up a member in a set than in a list.
That's only if you're looking for the presence of one specific item. All found primes need to be checked anyways to verify the current number, so it wouldn't matter in this case.
@@Daniel_WR_Hart Yes, you're right!
brilliant and spooky !!!
Can we do in the next video following concepts?
- name mangling (__double_leading_underscore name for class attribute)
- @staticmethod
- decorators
- _single_leading_underscore
please please make a js tutorial u r the best
¡Gracias!
Thank you for your kind support!! 💜🦉
6:08 how is a generator expression different than a set syntactically? Because I would assume (x**2 for x in y) is a set (and therefore store all those numbers in your memory)
do you mean tuple? sets are enclosed in { }
Hi , great lesson & good job , thanks for that kind of helpful tutorial,
I want to eiditing like you , can you start nxt lesson on eiditing
“is_prime” in code could be replaced by a for-else statement
What is the name of background music ?
Is there a video on args and **kwargs
Great last lines! 😂
Thanks
Thank you for your kind support! We're so glad you're watching!! 💜🦉
I just so much love her...😃
the prime_number program is not for prime numbers but odd number, there is no code here checking for prime number
is it really voice controlled to run ? :P
Seems like magic to me
Hmm maybe Socratica is the generator of all generators...not sure though cant fit the entire list in my memory😁
I was there !