Count Inversions in an Array | Brute and Optimal

[@takeUforward]

Please watch our new video on the same topic: th-cam.com/video/AseUmwVNaoY/w-d-xo.html

[@namannema3349]

this link take u to the same video we are watching

[@yogeshkaushik8316]

@@namannema3349 thats what recursion means

[@user-ic7xs9vh7i]

@@yogeshkaushik8316 😆

[@satvrii]

Nowadaya strivers voice has become so calm and soft 😅❤

[@anuradha3868]

True...as compared to his previous vdos 😂

[@newsbuster2194]

😂

[@shubhamkumar-hx1fb]

​@@anuradha3868 same thought 😂

[@saswatrath4646]

abe mic kharap tha pehle😂

[@anuplohar23]

Best count inversion video on TH-cam, your method of teaching is very best that it gets me understand very easily 🌟🌟🌟

[@Manishgupta200]

I'm trying this problem and solved it by myself by taking count as global variable.. But you taught us in a vary optimal way without taking count as a global variable. Really best optimal approach. Thankyou ❤

[@bishakhdutta8427]

whats the complexity of your solution?
can you share it?

[@Manishgupta200]

@@bishakhdutta8427 same as merger sort merge algorithm

[@attackgaming9940]

Making the complex problem looks simpler is a kind of skill that striver only has🛐

[@_AASHISHSHAH]

this is the best playlist in world. thank you stiver for your effort.

[@senseiAree]

Striver your voice is very soothing and calm bro ❤.... I use it to sleep at night AND study... and I don't feel sleepy

[@SuvradipDasPhotographyOfficial]

The best count inversion video on TH-cam.. Thanks a lot Raj.. stay blessed❤

[@bmishra98]

Completed the playlist. This was the best recursion playlist I ever went through. Thanks a lot Striver.

[@cinime]

Understood! Super amazing explanation as always, thank you very very very much for your effort!!

[@gajendrakumar8271]

Finally completed this recursion playlist and Thanks a lot striver for great explanation throughout and patiently drawing recursion tree. patience is the key to solve and teach anything . And you have it man and you are teaching that too. Thanks a lot again

[@xtzyrox2764]

I am happy with the brute force now I will see optimal 1 week before interview bcz University exams are in this month

[@b39_navkaransingh73]

Did anyone ask you?

[@Cartidise]

I usually don't comment but wanted to say that just subbed your channel. This is the best explanation I've ever got. THANKS A LOT:>)

[@user-jm6bc3rt5e]

Understood
THE BEST EXPLANATION
Excellent playlist 👌 👏 ❤

[@the_haryannvi_coder]

If u don't wanna use cnt in mergeSort function, you can do this:-
int mergeSort(vector &arr, int low, int high) {
if (low >= high) return 0;

int mid = (low + high) / 2 ;
int left = mergeSort(arr, low, mid); // left half
int right = mergeSort(arr, mid + 1, high); // right half
int m = merge(arr, low, mid, high); // merging sorted halves
return left + right + m;
}

[@prateek5208]

such an awesome expalination bhaiya just approach dekhkr hi dimag ma intution agya ki merge ma kase implement krenge , you are best

[@selvaarumugam370]

As usual your teaching jus made coding much easier than it is bruh!! Waiting for Binary Search series bruh!!!!

[@KapilMaan-vw9sd]

thanks sir for making this wonderful video sir !!!

[@8bit_hero850]

Can we realistically solve this if it comes in an interview given we haven't solved it before? I mean how do can you get the intuition of merge sort from this problem? I really don't get it.

[@unknown47896]

no way bro

[@flakky626]

Exactly my thought, No way you gonnna come up with something like that on your own

[@shaikhanuman8012]

good explanation on count inversion

[@akritisneh2849]

So much crystal clear!!!!Thank youu❤

[@SaumyaSharma007]

OMG Bawal explanation Striver Bhaiya.😃

[@elamaran350]

Understood ❤ At last

[@mehulthuletiya497]

Timestamps:
---------------------
00:40 Problem Statement
02:11 Brute force approach
02:52 Pseudocode
03:35 Complexity
04:05 Optimmal solution
04:22 Intuition
10:33 Approach + Dry-run
18:02 Code
22:37 Complexity

[@aditijagtap7853]

Best teaching approach so far!!!!

[@prateekgoyal7009]

This is the best explanation I've ever got.

[@shiveshgupta1705]

i just imagine if all the problems would be available on this channel in future

[@vaibhav56]

I was struggling with the solution but as soon as you mentioned merge sort it clicked in my mind

[@pallavi22222]

your problem solving approach explanation is superb

[@vikasbagri1225]

Understood it very well
Thanks for this amazing series

[@abhaypatel379]

thanks striver for making a complex question into very easy question
🤗

[@HR-pz7ts]

Amazing I solved two questions using the same logic.

[@chiragbirla5606]

Best explanation ever for this problem

[@nishant4595]

understood!!!

[@lakshaysawhney9988]

Thoroughly enjoyed the problem!!

[@user-ck6kn1ty8x]

Thank You Bhaiya

[@harigs72]

Happy teacher day 🎉❤

[@mohd786ishaan]

UNDERSTOOD SIR ! GREAT EXPLAINATION

[@gauristar4094]

Superb logic, Understood!!!

[@AbjSir]

// Everytime while sorting you move an element to the left (assume nobody moves to right agar chote walo ko aana hoga to left me aa jayenge)
// if an element crosses another element while moving to the left for the purpose of sorting then it should increase the count of inversion

[@yashisrivastava6196]

just wow explanation

[@pushankarmakar1783]

understood!
def merge(arr,l,mid,h):
temp=[]
i=l
j=mid+1
cnt=0
while i

[@muqeemuddin8057]

Hey, can you make a video on binary insertion sort and compare it's time complexities with insertion sort. Thanks for your videos on DSA.

[@NoniSabharwal]

The way he said wow! Uff in love with the voice

[@MJBZG]

didn't understand much but will try again

[@sukhpreetsingh5200]

Understood amazing explanation

[@ishasinghal3457]

Best explanation ever

[@GuruPrasadShukla]

understood the approach sir
thanks alot

[@theresilientpianist7114]

Really it was a great series Striver.🔥🔥

[@ishangujarathi10]

loved the optimal solution, intuition op!

[@Sumeet_100]

Thank you for this video !!

[@NazeerBashaShaik]

Understood, thank you.

[@pavanjegurupati]

Great explanation!!

[@unnatishukla8513]

awesome as always!!!!🤩

[@steverogers7050]

very nice explanation bhaiya

[@vk-mc5tq]

Global vs Local
In Global variables values updated dynamically but in local variables we need to pass updated values (manually) to subsequent functions

[@abhishekverma4693]

thank you so much for watching

[@DeadPoolx1712]

UNDERSTOOD;

[@anshasati1920]

Understood Sir🥳

[@sivasaimanchem4399]

All i can say is Thankyou so much ❤🙌

[@navdeepkumar9160]

Great video

[@hashcodez757]

understood Bhaiya!!

[@anushkajain8480]

Understood.

[@RIyaGupta-iz9iw]

Understand bhaiya

[@saitehith6647]

Superb Explanation

[@satyamgupta4808]

very nice video

[@sarangkumarsingh7901]

Nice lecture................

[@rohitkumarpilania94]

Badhiya kaam kar rahe ho, see you soon

[@AnjuGupta-sz1uk]

understood

[@grm642]

Thank you😊

[@ShubhamKumar-uf3gc]

loved that bhaiya

[@ravalikatalks5285]

thanks alot bhaiya

[@hemantpatel1413]

understood.

[@nayankhuman1043]

Understood :)

[@pawan_kk]

understood

[@atharva3571]

I understood the problem

[@vivekbhore5722]

thank u striver

[@her_soulmate]

Understood 🎉

[@YourCodeVerse]

Understood✅🔥🔥

[@Sameer-wm8dn]

Understood

[@user-je7tz6le4k]

These types of questions always demotivate me... like how you can think of such kind of solution in an interview

[@nikhilprakashahir5730]

so aweesome

[@JRK_RIDES]

Understood!

[@GhostVaibhav]

Understood🔥

[@ajaykr2811]

13:05 the kind of excitement I want while learning DSA.

[@culeforever5408]

understood :)

[@abhishekahirvar7783]

thanks mate

[@venup2813]

Understood brother❤️

[@user-lw9dj8we7k]

Understood sir

[@HarshChoudhary-vm6eh]

Understood thats great...

[@ayushvyas5212]

awesome

[@infomania_by_ayush7901]

Understood, but I am gonna need some time to implement this.

[@infomania_by_ayush7901]

Implemented.

[@divyaanandhan6021]

Thanks 😊👍

[@user-nk1mb5fy7j]

UNDERSTOOD

[@jayshukla6096]

Understood!

[@varunpalsingh3822]

understood 👍👍

[@DSAMADESIMPLE]

Understood sir

[@pritipatil4021]

Understood...!!!!

[@vikasgupta1828]

Thanks

[@mount2020]

Thank u bhai