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

► Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
#GATE2020#PSU #MostExpectedQuestions#freeCoaching

[siddharthjha_]

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

[ayushrai]

Last night study engineer's assemble please 🤝😎😂

[CdeXayaN]

Targeted audience-GATE🤠 actual audience-Collage and university 😎

[Jeetu]

Gate smashers: Smashing GATEs intelligently.

[RajivYadav-gbnb]

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.

[Aesthetic]

Aapne DBMS ke saare topics bht acche se bola hai, , ,

[ayushrai]

Studying One night before exam, engineer's assemble please 🤝😎😂

[navneetkaur]

Agr kise ka pass inka merge sort ki example ka link hai tu plz send krdo abhi

[arghakundu]

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.

[saurabhpal]

Sir when you will start your paid coaching for GATE?

[ayushrai]

Tomorrow is my exam and I'm learning the concepts here 😂

[SaumyaSharma]

Sir ek doubt h ki average comparisons decimal mein kese ho skta
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 sir Reply 🙏

[kritleenkaur]

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

[attitudequeen]

Sir....your lecture is very amazing and interesting. Really.. Me from Pakistan. I like ur videos.. God bless u sir. 🍁

[cheenakshibansal]

Sir if no. Of elements in d list are more than 2 then ? Bcs with 2 elements it is easy to make comparisons

[surachitsarkar]

2, 4 and 1, 3 is another possibility. (similarly 2, 3 and 1, 4.)

[benazirbuttos]

Sir.... Your teaching is amazing...please explain in English...I'm from south India so its little bit difficult to understand (Hindi)

[Aditya-snle]

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 for NAT question how much closeness of answer is accepted?

[SaumyaSharma]

Sir ek doubt h ki average comparisons decimal mein kese ho skta
Btw your explanation was awesome 🙏
May u plzz reply

[cricketfunda]

1st view ...🤗..
Sir u are doing great work...Thanks...🙏🙏