DSA-in-December

✨ 𝗗𝗮𝘆 𝟭4: Sorting ( Quick Sort + Merge Sort)✨

🙋🏻‍♀️ We have Studied basics of Sorting on Day 4 (Refer day 4 - 4th dec )

📌 What is Quick Sort ?

Quicksort is an algorithm used to quickly sort items within an array no matter how big the array is. It does this through a divide-and-conquer method that divides a single large array into two smaller ones and then repeats this process for all created arrays until the sort is complete.

📌 What is Merge Sort ?

Merge sort is one of the most efficient sorting algorithms. It works on the principle of Divide and Conquer based on the idea of breaking down a list into several sub-lists until each sublist consists of a single element and merging those sub lists in a manner that results into a sorted list.

✏️ 𝗙𝗼𝗿 𝗯𝗲𝘁𝘁𝗲𝗿 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱𝗶𝗻𝗴 𝗿𝗲𝗳𝗲𝗿 𝗳𝗼𝗹𝗹𝗼𝘄𝗶𝗻𝗴 𝗮𝗿𝘁𝗶𝗰𝗹𝗲𝘀 ;

Quick Sort

  1. https://www.programiz.com/dsa/quick-sort 2)https://medium.com/programminginpython-com/quicksort-algorithm-in-python-70c51cf9851b 3)https://towardsdatascience.com/an-overview-of-quicksort-algorithm-b9144e314a72

Merge sort 1)https://www.geeksforgeeks.org/merge-sort/ 2)https://www.programiz.com/dsa/merge-sort

📽️ 𝗧𝘂𝘁𝗼𝗿𝗶𝗮𝗹 𝗟𝗶𝗻𝗸𝘀; Quick sort 1)https://youtu.be/Dl6HT-NM_q4 2)https://youtu.be/WprjBK0p6rw 3)https://youtu.be/tWCaFVJMUi8 Merge sort 4)https://youtu.be/4z9I6ZmeLOQ 5)https://youtu.be/sV4RhDIIKO0 6)https://youtu.be/6Aqxv29RGPc

👩‍💻 𝗤𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱: 👇

  1. https://www.hackerearth.com/practice/algorithms/sorting/quick-sort/practice-problems/algorithm/chef-and-chefa-a5c8800a/
  2. https://www.hackerearth.com/practice/algorithms/sorting/quick-sort/practice-problems/algorithm/chef-and-chefa-a5c8800a/
  3. https://www.hackerearth.com/practice/algorithms/sorting/merge-sort/practice-problems/algorithm/interesting-number-2-752e7fa2/
  4. https://www.hackerearth.com/practice/algorithms/sorting/merge-sort/practice-problems/algorithm/lets-swap-5075ade8/
  5. https://leetcode.com/problems/sort-list/