Lecture 59: Merge Sort Algorithm

[@CoderArmy9]

Merge Sort Algorithm ko Achee se chamka do, Baaki Code meine Homework sheet mein hi provide kar rkha hai, extra questions bhi hai usmein, isly unko bhi kar lena...

[@Ravi-wn4pe]

Thank you bhaiya for depth of my heart, Merge Sort pehle bhi pada tha but Chamaka aaj. All because of you...❤. All Problems that I solve today at GFG and Leetcode is because of you. I am very lazy but apke karan regular hu since starting. Keep Going and Providing us such awesome lecture . Thanks once again bhaiya.

[@akashkewat1219]

Haa bhaiya needed a revision. 😊

[@shrishtdev9961]

nice bro aap kuch na kuch yna hi btate hai hr video

[@kanhamallik33]

Sir aye class pe c++ clear hojae Kiya plz sir batado

[@Mishra_ritesh]

Bhaiya bahut lamba code hai... Kahi chamk rha hai kahi nhi bhi...par pura class le liya 😢

[@anupammishra6514]

Bhaiya aaj sara concept samjh aa gya h chamak gya pura 😌😌❤❤❤ you are the best bhaiya ❤❤

[@universalmeditationmusic9299]

mergesort ka concept chamka gay our bhute achhe se samjh me gaya best explain

[@5harshitshrivastava]

day 59 ☑ merge sort understood💯

[@manishsati-wv8xz]

Bhaiya jab aap padate ho, sach mein sab easy lagta hai, thanku

[@zafrul_islam]

mja aa gya bhaiya ekdam chamak gya college me bhi mai merge short padha tha and mujhe bhut dar lg rhi thi merge short se but aap to smoothly samja diye wo bhi bhut aache se🙂🙂

[@asad_iliyas]

1:18:00 H/W ✅ #include #include using namespace std; void merge(int arr[],int start,int mid,int end)//This funtion will merge and sort { vectortemp(end-start+1); int left=start,right=mid+1,index=0; while(left

[@vishalashnani.3733]

mazaa aa gya bhaiya kafi der se phasa hua tha samajh hi nahi aa rha tha concept pr aapki video dekh kar everything is crystal clear...✌✌

[@PranayBanait-n3j]

chamak chuka hai bhaiya pura concept

[@itshirdeshk]

Day 82 🔥✅ Bhaiya chamak gya sab kuch acche se ✨

[@sheetalsharma1675]

you cleared all logic and conspect this question.....

[@SiyaRamSiyaRam1008]

Bhaiya chamak Gaya bahut dhanyavad aapka mjhe laga nhi tha samjh pauga lekin bhaiya you are great 🙏

[@thepuncher8387]

wow....really cleared all the concept

[@pratapkumar7249]

chamak gaya bhiya badiya se

[@tripurarisen4362]

Chamak gaya sir ji..thank you sir for making boring DSA interesting

[@RJFF3-r7w]

Maja aa gaya bhaiya, ek dum chamk gata

[@Vikash_chauhan_vkc]

Me to socked hu dsa k itna acha content youtube me bhi aa sakta hai aisa to nahi paid me milne wala aur ni bhaiya aur didi log se ❤❤ thnks bhaiya for this amazing dsa

[@RahulGupta-wv7lv]

merge sort chamak gaya sir ji

[@AnshuGupta-xw8ly]

you made this algorithm to easy , love your way of explanation 🙂

[@MohitKumar-b5o3b]

good explanation sir

[@joydeep-halder]

HW: Descending order ✅✅ if(nums[left]>=nums[right]) // only this line will change

[@Forpcuse-ke2fl]

Dhanyawaad sir.. you have explained it very easily😀

[@priyanshuarya6317]

Chamak gaya merge sort❤

[@priyanshusonii]

Amazing Explanation

[@omkadam2986]

Bhaiya chamak gaya 👍

[@CR-ns2xs]

Amazing content bhaiya..love from pauri garhwal ❤

[@Ujjwalkumarsavita]

chamak chuka hai pura concept 👍 bhaiya😊

[@narutouzumaki-kc6cj]

thanks bhaiya for this amazing lecture ❤❤

[@heetpatel3037]

Chamka bhaiya chamka 👍🏻 Rohit Bhai op

[@Manav00121]

maza aa gaya bhaiya thodi tought ahi but its ok we undersand

[@vipulkumar1830]

best video ever on merge sort ❤

[@atul2111]

vrey nice explanation bhaiya 😍

[@AnshikaDas-x3z]

chamak gya bhaiya acche se❤

[@devendrasharma8750]

merge sort chamak gya acche se bhaiya

[@shubhamsinha5159]

Well description concept 👌

[@jasmeetsingh3170]

descending order mei sort karne ke liye simply less than ke sign ko greater than mei convert karna hai or ho gya apka descending order with help of merge sort. ab ap socho ki konse less than sign ko change karna hai.

[@rahulkumarsahu205]

What a teacher 🫡🫡

[@pallavi_jha2004]

Bhaiya, unique number of occurence leet code problem ka optimize solution nhi ho pa rha h ,please help

[@darkshiner494]

rohit bhai ur the best

[@junaidsayem279]

beautiful concept

[@sarthakgupta096]

Sir ji chamak gya❤

[@shailjayadav7995]

Good morning Bhaiya

[@AakashParvani]

Day 82 Done 👍✅ Chamak Gaya

[@alonemusk107]

Chmak gya 😁❤❤❤

[@PranjaliKeshari-ql9sp]

chamak gaya bhaiaya

[@shubhamkumarjha9192]

Good morning bhaiya ji 💖

[@YashSaini007]

Bhaiya Radhe Radhe 🙏

[@JashanpreetSingh-zh2de]

Mza agya 😀bhaiya

[@debadityamukherjee5498]

very nice explanation

[@krishna-cu2ju]

nicely explained....keep going.

[@ankushladani496]

Done Bhaiya... Day 82/180 ✅

[@harshitgupta917]

best video tha bhaiya

[@shree_275]

best lec forever

[@bibekkumarpanda4388]

Great lecture

[@Js0109Js]

best explanation!

[@joydeep-halder]

Good morning bhaiya ❤❤

[@AMITKUMAR-ds4hp]

Good morning boss ❤

[@patanwar]

Shaandar ✨♾️

[@weinstoller7423]

clear hai, hanji bhaiya😂

[@vivekanandkumar8493]

Bhaiya chamak gaya merge sort

[@harimohansharma5561]

bhaiya chamak gya pora

[@nilkanta1790]

Hat's off to you sir ❤❤❤

[@abhinavparashar1934]

// & Merge Sort using Recursion // ^ Method 1 : Output will be In Increasing order #include #include using namespace std; void merge(int arr[], int start, int end, int mid) { // difine a temp vector and store sorted array elements in it vector temp(end - start + 1); int left = start, right = mid + 1, index = 0; // sorting elements from left and right part of array and stored in temp vector while (left

[@Coder-rohits]

thoda complex tha

[@mohitkumar-ek6zh]

bhaiya really thankful to u

[@joydeep-halder]

HW: Count Inversion ✅✅ while(left

[@AbhishekKumar-lu3lp]

can you solve the problem of the day in gfg Reach the Nth point //{ Driver Code Starts #include using namespace std; // } Driver Code Ends class Solution{ public: int nthPoint(int n){ // Code here if(n

[@joydeep-halder]

@@AbhishekKumar-lu3lp Pura question padho, ho jayega. You have missed one crucial information mentioned in the problem itself.

[@AbhishekKumar-lu3lp]

@@joydeep-halder ho gya solve ✨

[@MohammedHasmi577]

Amazing sir

[@YASHYADAV-f9i]

bhaiya maja aagya

[@Shreyashskmvj]

Chamak Gaya bhaiya

[@Ajkr2]

#include #include using namespace std; void merge(int arr[],int start,int mid,int end){ vectortemp(end-start+1); int left =start ,right =mid+1,index =0; //index jaha value fill krni hai while(left

[@Harshmishra0007]

Bahiya time complexity mai to apne recursion ki height nikali jo ki logn aayi pr hr level aur bhi to kaam ho rha hai unhe bhi to add krenge bs yhi doubt hai smaj nhi aa rha hai agar function bnaye T.C ka to T(n)=2T(n/2) +n bnega. Ye ek baar phir btao plzzz

[@prathmesh_Bidve]

Good morning bhaiya

[@SubhashKumar76-x8g]

chamak gya bhaiya

[@ShubhamPanchal-zv7bp]

bro ye sequence me kyo nahi he assignment kuch kuch missing he

[@universalmeditationmusic9299]

awesome lecture

[@SurajGupta-ux2se]

what an explanation

[@karthikhkamath]

Bhaiyya I think you hold the pen ulta?, uske pointed side se likhna hotha hai na?

[@rvkumar2446]

Chammak gya

[@ritikrawat6105]

merge sort

[@sbworld13]

Chamka ✨

[@mdpsycho2op670]

Morning Bhaiyaaaaa

[@YogeshwarGupta-r3u]

jhakas bhaiay

[@shree_275]

merge sort :- #include #include using namespace std; void Merge(int arr[], int start, int end, int mid) { vector temp(end - start + 1); int left = start, right = mid + 1, index = 0; while (left

[@Surenderdubey221]

Good

[@akashkewat1219]

Thanks bhaiya. 😊

[@GopalKumar-xu3iw]

Day 82/180 done ✅✅✅✅✅

[@himanshuchaure]

class Solution{ public: // arr[]: Input Array // N : Size of the Array arr[] // Function to count inversions in the array. long long merge(long long arr[], vector&temp, int start, int mid, int end){ long long left=start, right= mid+1, index=start; long long c=0; while(left

[@durgaprasadparmar5339]

thank you bhaiya

[@RishabRajGupta-m9i]

Bhaiya, sab samajh me aa gya lekin Mic achi use krlo

[@sumitkumarmahto4312]

Bhaiya isko koi diffrent method se bhi bana sakte hai na dono sahi hoga na

[@Anonymous____________A721]

S

[@nanumix3167]

48:46

[@Memerluffy]

48:14

[@kartikeydwivedi6892]

done 👍

[@reality_today]

chamak gya

[@rhitam_biswas]

Merge sort ✅✅✅✅

[@vaibhavpatil3411]

I have created animation for the explanation of merge sort: kzbin.info/www/bejne/nKvRpayifZaCj80

[@Aryan-wl7mc]

Morning 😄

[@allinonemoviesyt]

Merge Sort for descending Order in Java: public static void merge(int[] arr,int start,int mid, int end){ int[] temp = new int[end-start+1]; int left = start; int right = mid+1; int index = 0; while(left

[@amankumaramar271]

1:1909 //merge sort on Decending onrder #include #include using namespace std; void merge(int arr[],int start,int mid,int end) { vectortemp(end-start+1); int left=start, right=mid+1,index=0; while(left

[@aniketshinde4426]

Check your answer, in first while loop of merge function their may be wrong if condition;

[@0sureshyadav0]

haan ji bhaiya