Array - 9: Implement Quick Sort | Quick Sort on Array
Source Code:https://thecodingsimplified.com/quick...
Solution:
we'll take a pivot point starting from start or end
Our aim is to put pivot point value to its correct location
For this we take two variable i & j
As soon as value at ith index is less than pivot point, we increase the i
Similarly as soon as value at jth index is greater than value at pivot point, we decrease the j
If i is less than j, we swap the value & when i greater than j, we swap value at pivot point & at j
When we're done with this, we recursively call with the left part & right part
At last you'll have all values as sorted
Time Complexity: O(nlog(n))
Space Complexity: O(1)
Do Watch video for more info
CHECK OUT CODING SIMPLIFIED
/ codingsimplified
★☆★ VIEW THE BLOG POST: ★☆★
http://thecodingsimplified.com
I started my YouTube channel, Coding Simplified, during Dec of 2015.
Since then, I've published over 400+ videos.
★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★
https://www.youtube.com/codingsimplif...
★☆★ Send us mail at: ★☆★
Email: thecodingsimplified@gmail.com
On this page of the site you can watch the video online Array - 9: Implement Quick Sort | Quick Sort on Array with a duration of hours minute second in good quality, which was uploaded by the user Coding Simplified 13 April 2020, share the link with friends and acquaintances, this video has already been watched 4,191 times on youtube and it was liked by 49 viewers. Enjoy your viewing!
