Тёмный

2.5 Merge Sort Algorithm | Divide and Conquer Sorting | Dry Run and Complete Analysis of Merge Sort 

KnowledgeGATE by Sanchit Sir
Подписаться 714 тыс.
Просмотров 23 тыс.
50% 1

📝 Talk to Sanchit Sir: forms.gle/WCAF...
💻 KnowledgeGate Website: www.knowledgeg...
📲 KnowledgeGate Android App: tiny.cc/KG_Offi...
➡ Do not miss our Bestseller Courses:
🔴 GATE Guidance-2025: www.knowledgeg...
🟠 GATE Guidance Plus-2025: www.knowledgeg...
➡ Contact Us:
🟩 Whatsapp Chat: wa.me/91859512...
📞Call on: +91-8000121313
🟦 Telegram Updates: t.me/kg_gate
🟩 Whatsapp Updates: www.whatsapp.c...
📧 Email: contact@knowledgegate.in
➡ Our One Shot Semester Exam Videos: 👇
▶ Operating System: • Complete Operating Sys...
▶ DBMS: • Complete DBMS Data Bas...
▶ Computer Network: • Complete CN Computer N...
▶ Digital Electronics: • Complete DE Digital El...
▶ Computer Architecture: • Complete COA Computer ...
▶ Data Structure: • Complete DS Data Struc...
▶ Algorithm: • Complete DAA Design an...
▶ Software Engineering: • Complete Software Engi...
▶ Theory of Computation: • Complete TOC Theory of...
▶ Compiler: • Complete CD Compiler D...
▶ Discrete Maths: • Complete DM Discrete M...
➡ Free Subject-Wise Complete PlayList: 👇
▶️ DBMS: tiny.cc/kg_yt_DBMS
▶️ Operating System: tiny.cc/kg_yt_OS
▶️ TOC|Automata: tiny.cc/kg_yt_toc
▶️ Computer Networks: tiny.cc/kg_yt_CN
▶️ Digital Electronics: tiny.cc/kg_yt_D...
▶️ Compiler Design: tiny.cc/kg_yt_C...
▶️ Computer Architecture: tiny.cc/kg_yt_COA
▶️ Data Structure: tiny.cc/kg_yt_D...
▶️ Algorithms: tiny.cc/kg_yt_A...
▶️ Set, Relation, Function: tiny.cc/kg_yt_D...
▶️ Graph Theory: tiny.cc/kg_yt_g...
▶️ Group Theory: tiny.cc/kg_yt_g...
▶️ Proposition: tiny.cc/kg_yt_p...
#knowledgegate #GATE #sanchitjain
*********************************************************

Опубликовано:

 

29 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 45   
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 9 месяцев назад
For complete Algorithm, check out this video: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-z6DY_YSdyww.html
@decipheredwisdom
@decipheredwisdom 2 года назад
I want to bring the attention of the creator to this point that, in audio there is a a background noise which is quite disturbing in such a beautifully explained video.
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 2 года назад
Dear student, thank you for your feedback, we'll definitely try to improve this in our upcoming videos 👍😊
@741ibrahim2
@741ibrahim2 2 года назад
#include using namespace std; void Mearge(int arr[],int st,int mid,int end){ int i = st,j = mid+1,ptr = 0; // an array to store the sorted elements int temp_arr[end-st+1] = {0}; while(i
@mirrakibulislam4789
@mirrakibulislam4789 2 месяца назад
It's true sir, according to you 'merge sort and heap sort to baki sare sorting algorithm ko pel dia'😅
@nunununu3690
@nunununu3690 Год назад
Hello sir, Sir aap for loop se complexity kaise calculate krte ho... Wo sahi se samjh me nhi aa rha he... Kya aap yeh sahi se samjha sakte ho ki while , for, nested if, nested loop se kaise complexity calculate kre? Thanks
@kanhucharansahoo8847
@kanhucharansahoo8847 2 года назад
Happy Teachers Day.
@gursimransingh2796
@gursimransingh2796 2 года назад
Sir, I am IIT graduate and now I want to pursue M.tech from IIT So my question is, do I have to appear in Gate exam? Guide me please
@rajivgupta9066
@rajivgupta9066 2 года назад
Sir quick sort
@ayushiyadav1
@ayushiyadav1 6 месяцев назад
24:16 amazing video sir! got clarity specially in division part, i also had misconception that both right as well as left part divides simultaneously. thanks for making it clear!! 💌🙏
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 6 месяцев назад
Am glad content is helpful. Keep learning & stay connected for more content😊
@yasirarfat58
@yasirarfat58 3 месяца назад
One who explainef recursive call.
@sain3031
@sain3031 Год назад
Thankuu Sir❤ Bestt Explanation🤗
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg Год назад
Most welcome dear! Keep supporting & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
@sunnysingh-yf2vw
@sunnysingh-yf2vw Год назад
Here sir is matching with scientist John von newmann
@raghavshukla5255
@raghavshukla5255 4 месяца назад
Dhanyawad sir 🙏🏻
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 4 месяца назад
You're welcome, Raghav. Keep learning, supporting & stay connected for more content👍
@741ibrahim2
@741ibrahim2 2 года назад
Best explanation ever I heard about this concept 💫✨
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 2 года назад
Thanks a lot dear 😍Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊
@741ibrahim2
@741ibrahim2 2 года назад
@@KNOWLEDGEGATE_kg definately sir I will
@Adarshhb767
@Adarshhb767 4 месяца назад
Only person who explained the flow of function call I had many confusion in this thanks for the video
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 4 месяца назад
You're welcome. Keep learning, supporting & stay connected for more content👍
@RukhsarMurtaza
@RukhsarMurtaza 4 месяца назад
The way you explained😊
@atishaymukuljain8216
@atishaymukuljain8216 8 месяцев назад
Thank you so much sir for creating the best lectures on sorting algos out there...💯👍
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 8 месяцев назад
You're most welcome Atishay, keep learning & following👍
@asheqarf3339
@asheqarf3339 2 года назад
No Mic was destroy to make this video
@shaileshhacker
@shaileshhacker 2 года назад
24:04 Heap Sort🙋🏽‍♂🙋🏽‍♂🙋🏽🙋🏽🙋🏽‍♀🙋🏽‍♀
@Parminder1.
@Parminder1. Год назад
Sir yeh dono algorithm likhne hoge exm me merge sort
@kevinpatel8909
@kevinpatel8909 2 года назад
Quick sort please
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 2 года назад
Uploading very soon. Stay tuned!
@rohitrohra7553
@rohitrohra7553 Год назад
just what i neeededddddddd
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg Год назад
Glad you enjoyed it😍Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
@bhupendraprajapat4262
@bhupendraprajapat4262 Год назад
Excellent sir 👍
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg Год назад
Thanks a lot dear❤ Stay connected for more upcoming contents 👍😊You can also check out our CS bundle course for complete preparation of Computer Science subjects, sharing course link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
@ARUN...502
@ARUN...502 Год назад
Very good sir 👍👍👍. Your teaching experience is very good ,,,🙏🙏
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg Год назад
Glad you enjoyed it😍Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
@pleasantdayNwisdom
@pleasantdayNwisdom Год назад
10ve sheetal naath ji
@sumitkumarbarik3919
@sumitkumarbarik3919 11 месяцев назад
Thank U Sir 🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 11 месяцев назад
Most welcome dear @Sumit❤ Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍😊
@nadeemmehraj5873
@nadeemmehraj5873 2 года назад
Happy Techers Day Sir 🙂🙂
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 2 года назад
Thank you so much! :)
@priyanshusharma6205
@priyanshusharma6205 11 месяцев назад
Thank you sir ji
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 11 месяцев назад
Most welcome dear @Priyanshu❤ Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍😊
@ripunjaysingh8003
@ripunjaysingh8003 Год назад
// C program for Merge Sort #include #include // Merges two subarrays of arr[]. // First subarray is arr[l..m] // Second subarray is arr[m+1..r] void merge(int arr[], int l, int m, int r) { int i, j, k; int n1 = m - l + 1; int n2 = r - m; // Create temp arrays int L[n1], R[n2]; // Copy data to temp arrays // L[] and R[] for (i = 0; i < n1; i++) L[i] = arr[l + i]; for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j]; // Merge the temp arrays back // into arr[l..r] // Initial index of first subarray i = 0; // Initial index of second subarray j = 0; // Initial index of merged subarray k = l; while (i < n1 && j < n2) { if (L[i]
Далее
Это нужно попробовать
00:42
Просмотров 368 тыс.
Watermelon magic box! #shorts by Leisi Crazy
00:20
Просмотров 23 млн
Qalpoq - Amakivachcha (hajviy ko'rsatuv)
41:44
Просмотров 333 тыс.
Merge sort algorithm
18:20
Просмотров 2,2 млн
Why You Should not Write Gate 2025
5:32
Просмотров 36 тыс.
Quick Sort For Beginners | Strivers A2Z DSA Course
35:17
2.8.1  QuickSort Algorithm
13:43
Просмотров 3,2 млн
IIT-JEE Toppers: Where Are They Now?
16:07
Просмотров 1,4 млн
Merge sort time complexity analysis
10:04
Просмотров 207 тыс.
Это нужно попробовать
00:42
Просмотров 368 тыс.