Тёмный

L-3.3: Imp. Question on Merge Sort | Divide and Conquer | Algorithm 

Gate Smashers
Подписаться 2 млн
Просмотров 410 тыс.
50% 1

👉Subscribe to our new channel: / @varunainashots
► Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on RU-vid: / gatesmashers
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
#GATE2020#PSU #MostExpectedQuestions#freeCoaching

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

 

1 окт 2024

Поделиться:

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 80   
@siddharthjha_18
@siddharthjha_18 Год назад
Sir, Mai toh Aise Soch Rha tha.. Maximum comparison is :; m + n -1 So, 2+2-1 = 3 And, minimum no. Of comparison = min(m, n) So, min(2, 2) = 2 So Avg = (min. + Max ) /2 = 5/2 = 2.5
@ayushrai3389
@ayushrai3389 2 года назад
Last night study engineer's assemble please 🤝😎😂
@Jeetu0301
@Jeetu0301 5 лет назад
Gate smashers: Smashing GATEs intelligently.
@C0deXayaN
@C0deXayaN 3 месяца назад
Targeted audience-GATE🤠 actual audience-Collage and university 😎
@Aesthetic0112
@Aesthetic0112 3 года назад
Aapne DBMS ke saare topics bht acche se bola hai,,,
@RajivYadav-gb6nb
@RajivYadav-gb6nb 4 года назад
Sir, Ur teaching method is amazing. In very less time I could understand all concepts of data structures, sorts, searches and Algorithm from ur tutorials. Ur videos were really helpful during my interview. Thank u so much for imparting knowledge in ur style. Keep up the good work and I thank u from the bottom of my heart.
@arghakundu4202
@arghakundu4202 5 лет назад
Sir, I don't have much words to explain. But I must say that I just love your videos (tutorials). Thank u so much sir.
@navneetkaur1239
@navneetkaur1239 3 года назад
Apka ka pass ina merge sort algo ki example ka link hai tu plz send krdo
@saurabhpal6210
@saurabhpal6210 5 лет назад
Sir when you will start your paid coaching for GATE?
@dhruvilsolanki9887
@dhruvilsolanki9887 2 года назад
he is mentor of all mentors?
@ayushrai3389
@ayushrai3389 2 года назад
Studying One night before exam, engineer's assemble please 🤝😎😂
@ayushrai3389
@ayushrai3389 2 года назад
Tomorrow is my exam and I'm learning the concepts here 😂
@pramodkoushiktr1895
@pramodkoushiktr1895 3 года назад
sir you dint explain merge sort.
@navneetkaur1239
@navneetkaur1239 3 года назад
Agr kise ka pass inka merge sort ki example ka link hai tu plz send krdo abhi
@rforrana12
@rforrana12 Год назад
Greatest teacher on this planet
@Aesthetic0112
@Aesthetic0112 3 года назад
Sir please Java boliye
@SaumyaSharma007
@SaumyaSharma007 3 года назад
Sir ek doubt h ki average comparisons decimal mein kese ho skta h..... Btw your explanation was awesome 🙏 May u plzz reply Sir ek aur doubt h: Cases 2 cases aur ho skte h (2,3) (1,4) jismein again 3 comparisons (2,4) (1,3) again 3 comparisons Total 5 cases Total 14 (2+3+3+3+3)comparisons Ans 14/5= 2.8 which is different from 2.67.....plzzz sir Reply 🙏
@arindamghosh636
@arindamghosh636 3 года назад
(2,3) (1,4) is same as (1,4) (2,3) also (2,4) (1,3) is same as (1,3) (2,4)
@shubhangihatkar1347
@shubhangihatkar1347 3 года назад
🌟🌟🌟🌟🌟
@cricketfunda2228
@cricketfunda2228 5 лет назад
1st view ...🤗.. Sir u are doing great work...Thanks...🙏🙏
@kritleenkaur357
@kritleenkaur357 4 года назад
Hi...Sir plss tell me why we take 3 cases...if machine doesn't skip any comparison...as u said machine performs accordind to algorithm..explain it plsss
@benazirbuttos6614
@benazirbuttos6614 4 года назад
Sir.... Your teaching is amazing...please explain in English...I'm from south India so its little bit difficult to understand (Hindi)
@hiteshdangi5077
@hiteshdangi5077 5 лет назад
Sir networks k videos create kro
@saikatsahoo2062
@saikatsahoo2062 2 года назад
Nice
@bidishagoswami3629
@bidishagoswami3629 5 лет назад
Thank u 👍👍 n Sir please provides more questns and topics related to GATE ..
@cheenakshibansal5318
@cheenakshibansal5318 3 года назад
Sir if no. Of elements in d list are more than 2 then ? Bcs with 2 elements it is easy to make comparisons
@SaumyaSharma007
@SaumyaSharma007 3 года назад
Sir ek doubt h ki average comparisons decimal mein kese ho skta h..... Btw your explanation was awesome 🙏 May u plzz reply
@NahidKhan-pr6ou
@NahidKhan-pr6ou Год назад
Float data type is taken in case of average so it gives a value without decimals
@mansheenkaur8729
@mansheenkaur8729 4 года назад
Sir please complete all topics
@lord_yzal
@lord_yzal 2 года назад
completed
@attitudequeen9970
@attitudequeen9970 3 года назад
Sir....your lecture is very amazing and interesting. Really.. Me from Pakistan. I like ur videos.. God bless u sir. 🍁
@tanushreemalviya964
@tanushreemalviya964 4 года назад
Thank you sir for this video 🙏🙂 good question, well explained 👍
@surachitsarkar5752
@surachitsarkar5752 4 года назад
2,4 and 1,3 is another possibility. (similarly 2,3 and 1,4.)
@Aditya-sn4le
@Aditya-sn4le 3 месяца назад
Sir if we take another case of 3,4 and 1,2 then similar to the 1st case we get 2 comparisons and the average will be 2.5....................So for NAT question how much closeness of answer is accepted?
@dimplegoyal8418
@dimplegoyal8418 3 года назад
Mje yh HOTA h Kitna effort krtye h teacher ❤️❤️
@SaumyaSharma007
@SaumyaSharma007 3 года назад
ek doubt h ki average comparisons decimal mein kese ho skta h..... Btw explanation was awesome 🙏 May u plzz reply Sir ek aur doubt h: Cases 2 cases aur ho skte h (2,3) (1,4) jismein again 3 comparisons (2,4) (1,3) again 3 comparisons Total 5 cases Total 14 (2+3+3+3+3)comparisons Ans 14/5= 2.8 which is different from 2.67.....plzzz can u Reply 🙏
@madhupriya9951
@madhupriya9951 5 лет назад
Sir please make a video on changed syllabus of NTA UGC net .
@abey1465
@abey1465 5 лет назад
Thank you sir🙏
@ankitamadiwal7306
@ankitamadiwal7306 4 года назад
Awesome teaching sir thank you
@ajaygenius4644
@ajaygenius4644 2 года назад
Thanks a lots 🙏 sirji
@yamisharma4879
@yamisharma4879 5 лет назад
4th👍👍👍👍
@soumambanerjee1816
@soumambanerjee1816 5 лет назад
bohot e achha conceptual sawal tha sir :) thanks Sir decidability ka sawal nahi ban rahe hai
@safionweb
@safionweb 3 года назад
Thanks for making this video.
@payalsonawane2404
@payalsonawane2404 4 года назад
what an explanation..................... ! tysm sir :)
@arpangupta2162
@arpangupta2162 5 лет назад
i got the concept which i was not aware of. thank you sir
@shraddhajaiswal8412
@shraddhajaiswal8412 3 года назад
Tq sir for your help🤗🤗
@hadirana5059
@hadirana5059 3 года назад
Sir u are really very very good😍😍
@roshinroy5129
@roshinroy5129 2 года назад
great explanation!
@juhimughal9469
@juhimughal9469 4 года назад
Sir is it save to solve this question like this, nlogn/m+n-1, this gives exactly same ans like you did by creating three cases thanks
@sufiyanadam
@sufiyanadam 3 года назад
Nahi ayega m+n-1 internal maximum comparison hota hai aur yahan total cases kitne ban sakte hain jinme m+n -1 ya usse kam comparisons honge, un sab ka sum denominator mein jayega.
@SHASHANKRUSTAGII
@SHASHANKRUSTAGII 5 лет назад
it is m+n-1
@muthukumarpalanichamy1439
@muthukumarpalanichamy1439 5 лет назад
Sir, what about this case: List 1 = {3,4} and List 2 = {1,2}. Is this same with the first case???
@umeshg17
@umeshg17 5 лет назад
Yup
@ayushigarg4370
@ayushigarg4370 2 года назад
Same i am asking
@kandalamkatyayani7399
@kandalamkatyayani7399 5 лет назад
Thank you sir
@ErAvinashPandey
@ErAvinashPandey 5 лет назад
Good evening sir
@khushbukushwah4991
@khushbukushwah4991 5 лет назад
Thank you
@ayushiyadav1
@ayushiyadav1 7 месяцев назад
thnx a lot sir 🙏
@ayushiyadav1
@ayushiyadav1 4 месяца назад
aggain here for revision heheee
@VK_BRANDING
@VK_BRANDING Месяц назад
Lamfaooooooo 😂
@anjalishukla5350
@anjalishukla5350 3 года назад
Can anyone plz tell is there anyone teaching ece subjects for gate preperation like him? TIA.
@shaikhabdulrahman8819
@shaikhabdulrahman8819 Год назад
Why did you divide 8 by 4 at 00:40
@ayushigarg4370
@ayushigarg4370 2 года назад
Sir isme ek case ek array (3,4) and (1,2) b ho skta hai kya bcz array sorted hi h
@sanketdas7000
@sanketdas7000 3 года назад
Without making us understand the merge sort u r giving us important question.. excellent teaching..for gate 2022
@ScriptStudy9555
@ScriptStudy9555 9 месяцев назад
Solute hai sir aapko kya padhate ho mja ho aa jata hai aapka vedeo dekhkar sare ke sare doubt turant clear ho jate hai 🙏🏻🙏🏻🙏🏻
@karishmabaghel81
@karishmabaghel81 3 года назад
Max no of comparison in merge sort is..O(n+m)....
@raunak6341
@raunak6341 3 года назад
sir merge sort theory is missing..you directly discussed the qstn
@shanumalikj18
@shanumalikj18 3 года назад
Arai sir yor are great 🔥🔥❤️thank you sir
@aymenfarooq651
@aymenfarooq651 11 месяцев назад
U have saved so many lives
@world_of_programming9653
@world_of_programming9653 2 года назад
1 2 4 3 which was in this case ?
@sushmahegde6479
@sushmahegde6479 4 года назад
Sir can you please make videos on number of comparisons performed by other sorting algorithms.
@vibhu613
@vibhu613 2 года назад
@GAU-C--RATNAKANTAHANSE
@GAU-C--RATNAKANTAHANSE 3 года назад
Thank you sir....
@arjunkhanna1803
@arjunkhanna1803 3 года назад
1:36 sahi pakde sir
@diptarajsen9483
@diptarajsen9483 3 года назад
Can you make a separate video on how merge sort works??
@manishpurohit1765
@manishpurohit1765 4 года назад
God bless you sir
@kanhaiyabhatt
@kanhaiyabhatt 4 года назад
sir is there any formula for this ?? what if the length is 3 ? please reply
@530gannisai8
@530gannisai8 3 года назад
Yes
@meenafazal2854
@meenafazal2854 4 года назад
Hi, can you also do a video on Merge sort.Your explanation is very good.
Далее
МАЛОЙ ГАИШНИК
00:35
Просмотров 225 тыс.
2.7.2.  Merge Sort Algorithm
24:07
Просмотров 1,7 млн
3. Divide & Conquer: FFT
1:20:52
Просмотров 316 тыс.
Min Max Algorithm with Divide & Conquer🏆
8:37
Просмотров 115 тыс.
Merge Sort Pseudocode | Merge Sort with example
8:09
Просмотров 408 тыс.
L-3.13: Heap sort with Example | Heapify Method
13:38
Просмотров 953 тыс.
Lecture 3: Insertion Sort, Merge Sort
51:20
Просмотров 836 тыс.