Generators in Python || Python Tutorial || Learn Python Programming

Поделиться
HTML-код
  • Опубликовано: 21 сен 2024
  • 𝙎𝙩𝙖𝙮 𝙞𝙣 𝙩𝙝𝙚 𝙡𝙤𝙤𝙥 𝙄𝙉𝙁𝙄𝙉𝙄𝙏𝙀𝙇𝙔: snu.socratica.... 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....
    ⧓⧓⧓⧓⧓
    Subscribe to Socratica + bell for notifications:
    bit.ly/Socratic...
    Find our programming playlists here:
    Python programming: bit.ly/PythonSo...
    SQL programming: bit.ly/SQL_Socr...
    ⧓⧓⧓⧓⧓
    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

Комментарии • 183

  • @Socratica
    @Socratica  2 года назад +9

    Wear a Socratica Python shirt for good luck coding: shop.socratica.com/products/python-by-socratica

  • @murphygreen8484
    @murphygreen8484 2 года назад +68

    I look forward to contributing to the acquisition of a human

    • @Socratica
      @Socratica  2 года назад +17

      We know they're out there!! 💜🦉

  • @rio_agustian_
    @rio_agustian_ 2 года назад +44

    FINALLY! Another python tutorial

  • @ekandrot
    @ekandrot 2 года назад +20

    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.

  • @satoriblue1349
    @satoriblue1349 2 года назад +24

    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!

    • @skwerone
      @skwerone Год назад

      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.

    • @anonfourtyfive
      @anonfourtyfive Год назад

      @@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 )

    • @jay_wright_thats_right
      @jay_wright_thats_right 9 месяцев назад

      @@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.

  • @markrobinsontraining
    @markrobinsontraining 2 года назад +66

    I've learnt so much from your videos; they are as informative as they are fun. Thanks so much!

  • @andrewballr
    @andrewballr 2 года назад +34

    These videos are absolutely brilliant.I like the format, short easily digestible videos on a very specific feature of python.

  • @Socratica
    @Socratica  2 года назад +22

    You can "stay in the Python loop" by signing up for our Python newsletter: snu.socratica.com/python

    • @anujkondhalkar9776
      @anujkondhalkar9776 2 года назад

      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.

  • @danielbadra9447
    @danielbadra9447 2 года назад +4

    No programing tutorial channel has such well written and engaging videos.

  • @АлексейБаскинов
    @АлексейБаскинов 2 года назад +8

    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.

  • @lxathu
    @lxathu 2 года назад +5

    Never was so much owed by so many to so few for so short but so informative videos.

  • @theepicguy6575
    @theepicguy6575 2 года назад +8

    that patreon addition was real smoooth!
    very infomative nonetheless. did expect yield with somewhere cause i stagger there

  • @laurentgauthier8742
    @laurentgauthier8742 2 года назад +5

    Those python videos and their slightly different approach are always crystal clear and interesting. Thank you very much for your work!

  • @rrahll
    @rrahll 2 года назад +5

    best artificial intelligence visualization in the world.
    Thanks for the tutorial )

  • @vadymvv
    @vadymvv 2 года назад +3

    I'm not a noob in programming, but i was strugle to understand yield in functions. Thanks to you all is clear now!

    • @Socratica
      @Socratica  2 года назад +1

      This is wonderful to read, thank you for telling us! 💜🦉

    • @sadhappy8860
      @sadhappy8860 Год назад

      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!

  • @youssefelamrani7905
    @youssefelamrani7905 2 года назад +2

    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

  • @MrOvipare
    @MrOvipare 2 года назад +1

    I've known Socratica with the excellent abstract algebra videos, glad to see that the Python series is just as good!

  • @AlbertoAvilaGarcia
    @AlbertoAvilaGarcia 4 месяца назад +1

    embedded humor in these videos is proportional to the love they cook them with 🥰

  • @BrianSwatton
    @BrianSwatton 7 месяцев назад

    I really enjoy the way these are presented. Clear and informative too.

  • @stuarthys9879
    @stuarthys9879 2 года назад +1

    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!

  • @GIULI4994
    @GIULI4994 5 месяцев назад

    this is the best video I've watched about generators! such an important but somehow slippery concept to explain

  • @ihateorangecat
    @ihateorangecat 2 года назад +3

    welcome back !!
    waiting for more python tutos...
    so much love from Myanmar🤍🤍🤍

    • @Socratica
      @Socratica  2 года назад

      Hello to our Socratica Friends in Myanmar!! 💜🦉

  • @Tuxiswatching
    @Tuxiswatching 2 года назад +7

    The prime generator will be way more efficient, if you only check until the square root of n is reached.

    • @Daniel-ng8fi
      @Daniel-ng8fi 2 года назад +2

      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

    • @kquat7899
      @kquat7899 2 года назад +1

      This was covered in an earlier video in the series.

  • @serta5727
    @serta5727 2 года назад +5

    It seems some knowledge was generated in my head :)

  • @BobP-ks1mu
    @BobP-ks1mu Год назад +1

    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!

  • @sibyjoseplathottam4828
    @sibyjoseplathottam4828 2 года назад

    I didn't even know that there were Python features like generator expressions! Thank you Socratica!

  • @pokerchannel6991
    @pokerchannel6991 День назад

    I love the production process. I love you

  • @KnightAmine
    @KnightAmine Год назад

    OMG ! Thanks alot! Clearer, it could not be ! 🙏

  • @raphaelprates1500
    @raphaelprates1500 Год назад

  • @PunmasterSTP
    @PunmasterSTP 2 года назад

    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!

  • @Ghostaladdin
    @Ghostaladdin 2 года назад +3

    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.

  • @SanataniAryavrat
    @SanataniAryavrat 2 года назад +1

    Good to see "Ulka Mohanty", the robotic actor

    • @snoopstp4189
      @snoopstp4189 2 года назад

      willing to admit Ulka is half the reason I watch these...

  • @conzymaher
    @conzymaher 10 месяцев назад

    Very helpful video and the style is hilarious. love it! Subscribed

  • @Daniel_WR_Hart
    @Daniel_WR_Hart 2 года назад

    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

  • @shudiptosekharroy651
    @shudiptosekharroy651 2 года назад +3

    Thanks!

    • @Socratica
      @Socratica  2 года назад +2

      Thank you for your support, kind Socratica Friend!! 💜🦉

  • @thegenxgamerguy6562
    @thegenxgamerguy6562 2 года назад +4

    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.

    • @hackerxxspacex6935
      @hackerxxspacex6935 2 года назад

      Can you please explain point number 2 and 3.

    • @thegenxgamerguy6562
      @thegenxgamerguy6562 2 года назад +1

      @@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.

  • @Jawahar-Engr.
    @Jawahar-Engr. 2 года назад

    Thank You AI Teacher... Now iam Confident enough in dealing with python generator 😃❤

  • @vikranttyagiRN
    @vikranttyagiRN 2 года назад +2

    Always great tutorials from this channel. Really appreciated

  • @IvanTheChemist
    @IvanTheChemist 2 года назад +1

    I wanted this video like a month ago! Great job and a bunch of thanks!

  • @nirajabcd
    @nirajabcd 2 года назад

    seriously these videos are on another level..

  • @muntedme203
    @muntedme203 2 года назад

    What a sense of humour...love it 😆

  • @jemzhatfelid5522
    @jemzhatfelid5522 2 года назад

    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!

  • @chris9352
    @chris9352 2 года назад

    Oh, she's back!

  • @FilterYT
    @FilterYT 2 года назад

    I would like to compliment the presenter, thank you.

  • @jhuyt-
    @jhuyt- 2 года назад +1

    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

  • @karim-gb5nx
    @karim-gb5nx 2 года назад

    This is actually impressive

  • @bass9052
    @bass9052 2 года назад

    Happy to see you again

  • @volbla
    @volbla 10 месяцев назад

    I recently found out about the "yield from" expression. You can use it to create generators with a recursive definition.

  • @mihalynemes4243
    @mihalynemes4243 2 года назад +2

    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.

    • @stuarthys9879
      @stuarthys9879 2 года назад

      I’m curious, why would this improve performance?

    • @mihalynemes4243
      @mihalynemes4243 2 года назад +1

      @@stuarthys9879 It is much quicker to look up a member in a set than in a list.

    • @Daniel_WR_Hart
      @Daniel_WR_Hart 2 года назад

      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.

    • @mihalynemes4243
      @mihalynemes4243 2 года назад

      @@Daniel_WR_Hart Yes, you're right!

  • @kirbymarchbarcena
    @kirbymarchbarcena 2 года назад +8

    ME: Another great lesson, what can you say about this?
    PYTHON: Hissssssss!

    • @skilz8098
      @skilz8098 2 года назад +1

      How did a python turn into a hydra? Generators!

  • @ehudkotegaro
    @ehudkotegaro Год назад

    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).

  • @Reep21
    @Reep21 2 года назад

    I've learned so much from this channel

  • @MJ-em_jay
    @MJ-em_jay 2 года назад

    I like the humor in these videos.

  • @kenhaley4
    @kenhaley4 2 года назад

    Never knew about the generator expression. Thanks!

  • @bugsolar4610
    @bugsolar4610 2 года назад

    Love and learnt so much from your videos,
    Want videos on Multithreading, multiprocessing, Class and static methods, public private and protected methods, super keyword.

  • @abyss2200
    @abyss2200 2 года назад +1

    Got a bit late, was so tired lately
    How's Socratica💝

  • @amauta5
    @amauta5 2 года назад +1

    I always love this series!

  • @daniellow426
    @daniellow426 2 года назад

    Learning a lot from you folks. Thank you.

  • @AhmadAsmndr
    @AhmadAsmndr 2 года назад

    I am very happy to see you again with another amazing video. thank you very much

  • @thinboxdictator6720
    @thinboxdictator6720 2 года назад

    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

  •  2 года назад +1

    Awesome and helpful video! Great work 🥰

  • @alurma
    @alurma 2 года назад

    Awesome video, didn't know about generators. Thanks!

  • @RichardGreco
    @RichardGreco 2 года назад

    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.

  • @MaximoPower2024
    @MaximoPower2024 2 года назад +2

    Why do you call close() method instead using break in order to stop the for loop?

  • @skilz8098
    @skilz8098 2 года назад +1

    I'd like to see an Assembly Tutorial from this channel!

    • @theblindprogrammer
      @theblindprogrammer 2 года назад

      What is Assembly used for these days? I thought C replaced Assembly

    • @skilz8098
      @skilz8098 2 года назад

      @@theblindprogrammer It can be used for a lot of things, especially when you are designing your own ISA...

  • @piotrmazgaj
    @piotrmazgaj 2 года назад

    This is gold!

  • @brpawankumariyengar4227
    @brpawankumariyengar4227 2 года назад

    Great Video …. Thanks …. I learn python from your videos

  • @yonaguska2050
    @yonaguska2050 2 года назад

    I've missed these tutorials

  • @__raghu.vir_
    @__raghu.vir_ 2 года назад

    Good job, ❤️from india

  • @mrmuranga
    @mrmuranga 2 года назад

    Thank you..always looking forward to the next video....

  • @gvimvim
    @gvimvim Год назад

    this footage is awesome

  • @Sneaky-Sneaky
    @Sneaky-Sneaky 2 года назад

    I joined this channel primarily to watch your Python videos. They are relaxing and stimulating simultaneously. After 20 years as a software engineer, it is quite unexpected !
    For each video()
    Smile = Smile + 100
    Next
    Print(Smile)
    3700. #my face hurts ! Thank you! ….. my I have another please ?
    If answer = “Not now or in any other space in time”
    Then 😢😭
    Else 🖖🏼

  • @dw2291
    @dw2291 Год назад

    Great vid, a lot of fun.

  • @giftfromyoutube
    @giftfromyoutube Год назад

    I just so much love her...😃

  • @ilkhomibrokhimov4729
    @ilkhomibrokhimov4729 2 года назад +1

    Thanks

    • @Socratica
      @Socratica  2 года назад

      Thank you for your kind support! We're so glad you're watching!! 💜🦉

  • @crazywallcat
    @crazywallcat 8 месяцев назад

    This is so good!

  • @qizhenggu20
    @qizhenggu20 2 года назад +2

    “is_prime” in code could be replaced by a for-else statement

  • @hanfmampf1234
    @hanfmampf1234 2 года назад +1

    Seems like magic to me

  • @Hardzinho_Yay
    @Hardzinho_Yay Год назад

    The most important thing Ilearned in this video is how 'yield' is properly pronounced

  • @chriss3154
    @chriss3154 Год назад

    Hmm maybe Socratica is the generator of all generators...not sure though cant fit the entire list in my memory😁

  • @MrEgol
    @MrEgol 2 года назад +1

    Grazie.

    • @Socratica
      @Socratica  2 года назад +1

      Many thanks for your kind support!! It's such a help. 💜🦉

  • @ozonefriendlyman
    @ozonefriendlyman 2 года назад

    "Pleasantly more finite" :)

  • @infinityinf1
    @infinityinf1 2 года назад +1

    Yes, it is possible to generate generators that generate generators.

  • @alinaderiparizi7193
    @alinaderiparizi7193 5 месяцев назад

    another awesome!

  • @RachidMarzouki
    @RachidMarzouki 2 года назад

    Excellent

  • @MIKIBURGOS
    @MIKIBURGOS Год назад

    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)

    • @sayanghosh6996
      @sayanghosh6996 9 месяцев назад

      do you mean tuple? sets are enclosed in { }

  • @bckzilla
    @bckzilla 2 года назад

    Very nice.

  • @rara4
    @rara4 2 года назад

    I was there !

  • @mawkuri5496
    @mawkuri5496 2 года назад

    i hope you create a machine learning tutorials using python. that would be awesome.. and math for machine learning separated playlist

  • @sebavergarasassi6462
    @sebavergarasassi6462 2 года назад

    ¡Gracias!

    • @Socratica
      @Socratica  2 года назад

      Thank you for your kind support!! 💜🦉

  • @SergiiStarodubtsev
    @SergiiStarodubtsev 2 года назад

    very nice!

  • @marcin2x4
    @marcin2x4 2 года назад

    Can we do in the next video following concepts?
    - name mangling (__double_leading_underscore name for class attribute)
    - @staticmethod
    - decorators
    - _single_leading_underscore

  • @omarcruz6326
    @omarcruz6326 2 года назад

    Python Videos are back ! 😍

  • @ubertcoolie8694
    @ubertcoolie8694 2 года назад

    Thanks for the video, it is great!

  • @kychemclass5850
    @kychemclass5850 2 года назад

    Reminds me of Sinclair BASIC GOSUB :)

    • @Socratica
      @Socratica  2 года назад +1

      Ahhh that takes us back!

  • @alexgora7530
    @alexgora7530 2 года назад

    LOVE YOUR WORK!!!

  • @douglassoaresmantova
    @douglassoaresmantova 2 года назад

    I love this channel

  • @ssh17hx0r
    @ssh17hx0r 2 года назад

    This is fantastic!

  • @ChrisHalden007
    @ChrisHalden007 2 года назад

    Great video. Thanks

  • @yonatantre
    @yonatantre 2 года назад

    please please make a js tutorial u r the best