Sorting: Bubble, Insertion, Selection, Merge, Quick, Counting Sort - DSA Course in Python Lecture 10

Поделиться
HTML-код
  • Опубликовано: 24 дек 2024

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

  • @GregHogg
    @GregHogg  5 месяцев назад +2

    Master Data Structures & Algorithms For FREE at AlgoMap.io!

    • @venkateshk816
      @venkateshk816 Месяц назад

      hey Greg so far you explained the nightmare of sorting(quicksort) very simply but it would be better to include the pivot elements with different positions like it is easy to do picking pivot at last or first but when considering the pivot at the middle element as a pivot i am getting little bit of confused in the part of list comprehension will you make a video of it or you can explain me in this chat

    • @dolamuoludare4383
      @dolamuoludare4383 Месяц назад

      Thank you greg

  • @harshgamer6105
    @harshgamer6105 5 месяцев назад +4

    damn! this is by far the easiest tutorial on quick sort, others were making it too complex!, thanks greg!

  • @SARABESHKANISHKARVAD
    @SARABESHKANISHKARVAD Месяц назад

    this is the easiest tutorial on quick sort I have seen

  • @Everafterbreak_
    @Everafterbreak_ 3 месяца назад +2

    your content is incredible!

    • @GregHogg
      @GregHogg  3 месяца назад +2

      Thank you!

  • @creativeusername4400
    @creativeusername4400 5 месяцев назад +8

    thank you greg you deserve a million subs!

    • @GregHogg
      @GregHogg  5 месяцев назад +3

      Thank you! Trying my hardest to get there haha

    • @amaliyaakopyan9200
      @amaliyaakopyan9200 Месяц назад

      @@GregHogg it is so pleasant to watch drawing how algorithm actually runs. this proper visualization makes understanding so much easier. btw, got count sort on my interview)

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

    Nice!

  • @adm7r
    @adm7r Месяц назад

    i'm following algomap, but don't see a link to this video in any of the sections, why?

    • @GregHogg
      @GregHogg  Месяц назад

      It's important theory, but not really that essential for most problems in my opinion

    • @adm7r
      @adm7r Месяц назад

      ​@@GregHoggmakes sense, thank you for the reply

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

  • @RaghuPratap-of8xs
    @RaghuPratap-of8xs 4 месяца назад +1

    what is the use of i

    • @sayyidmogaka6754
      @sayyidmogaka6754 7 дней назад

      It’s used as an index when iterating through the array,i is the conventional one but you can use any letter

  • @prashanthnellutla6681
    @prashanthnellutla6681 2 месяца назад

    Counting sort was overwhelming and overkill

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

    Doesn't your implementation of quick sort use O(n log(n)) space as you are creating many new lists?

    • @fantastic-b2m
      @fantastic-b2m 5 месяцев назад

      it only creates one additional list which he named it as counts

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

      No, he creates a new R and L list each time and passes them down

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

      Yes but not all are present at the same time

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

      @@GregHogg So at most at one time, they will have O(n) space in total?

  • @kleejensen8684
    @kleejensen8684 3 месяца назад

    What about heap sort???

    • @Ganesh-lm5dx
      @Ganesh-lm5dx 2 месяца назад +1

      he has a separate video for heap data structure and it is pretty easy to understand

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

    explain with user input list

  • @Everafterbreak_
    @Everafterbreak_ 3 месяца назад

    are you drawing using the mouse? i need these skills. lmaooo