I want to bring the attention of the creator to this point that, in audio there is a a background noise which is quite disturbing in such a beautifully explained video.
Most welcome dear! Keep supporting & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Glad you enjoyed it😍Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
24:16 amazing video sir! got clarity specially in division part, i also had misconception that both right as well as left part divides simultaneously. thanks for making it clear!! 💌🙏
Thanks a lot dear❤ Stay connected for more upcoming contents 👍😊You can also check out our CS bundle course for complete preparation of Computer Science subjects, sharing course link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Glad you enjoyed it😍Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Most welcome dear @Sumit❤ Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍😊
Most welcome dear @Priyanshu❤ Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍😊
#include using namespace std; void Mearge(int arr[],int st,int mid,int end){ int i = st,j = mid+1,ptr = 0; // an array to store the sorted elements int temp_arr[end-st+1] = {0}; while(i
Hello sir, Sir aap for loop se complexity kaise calculate krte ho... Wo sahi se samjh me nhi aa rha he... Kya aap yeh sahi se samjha sakte ho ki while , for, nested if, nested loop se kaise complexity calculate kre? Thanks
// C program for Merge Sort #include #include // Merges two subarrays of arr[]. // First subarray is arr[l..m] // Second subarray is arr[m+1..r] void merge(int arr[], int l, int m, int r) { int i, j, k; int n1 = m - l + 1; int n2 = r - m; // Create temp arrays int L[n1], R[n2]; // Copy data to temp arrays // L[] and R[] for (i = 0; i < n1; i++) L[i] = arr[l + i]; for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j]; // Merge the temp arrays back // into arr[l..r] // Initial index of first subarray i = 0; // Initial index of second subarray j = 0; // Initial index of merged subarray k = l; while (i < n1 && j < n2) { if (L[i]
For complete Algorithm, check out this video: th-cam.com/video/z6DY_YSdyww/w-d-xo.html
I want to bring the attention of the creator to this point that, in audio there is a a background noise which is quite disturbing in such a beautifully explained video.
Dear student, thank you for your feedback, we'll definitely try to improve this in our upcoming videos 👍😊
Thankuu Sir❤ Bestt Explanation🤗
Most welcome dear! Keep supporting & stay connected for more amazing contents👍😊
You can also check out our course for all Computer Science subjects, sharing the link below:
www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Best explanation ever I heard about this concept 💫✨
Thanks a lot dear 😍Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊
@@KNOWLEDGEGATE_kg definately sir I will
Only person who explained the flow of function call I had many confusion in this thanks for the video
You're welcome. Keep learning, supporting & stay connected for more content👍
just what i neeededddddddd
Glad you enjoyed it😍Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
24:16 amazing video sir! got clarity specially in division part, i also had misconception that both right as well as left part divides simultaneously. thanks for making it clear!! 💌🙏
Am glad content is helpful. Keep learning & stay connected for more content😊
Excellent sir 👍
Thanks a lot dear❤ Stay connected for more upcoming contents 👍😊You can also check out our CS bundle course for complete preparation of Computer Science subjects, sharing course link below:
www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Sir u are actually a saviour for student,you have made such a difficult topic so easy...thank u so much sir❤❤
You're most welcome, Roshni. Keep learning, supporting & stay connected for more content👍
Very good sir 👍👍👍. Your teaching experience is very good ,,,🙏🙏
Glad you enjoyed it😍Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
It's true sir, according to you 'merge sort and heap sort to baki sare sorting algorithm ko pel dia'😅
Thank U Sir 🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
Most welcome dear @Sumit❤ Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍😊
24:04 Heap Sort🙋🏽♂🙋🏽♂🙋🏽🙋🏽🙋🏽♀🙋🏽♀
The way you explained😊
Thank you sir ji
Most welcome dear @Priyanshu❤ Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍😊
Thank you so much sir for creating the best lectures on sorting algos out there...💯👍
You're most welcome Atishay, keep learning & following👍
Happy Techers Day Sir 🙂🙂
Thank you so much! :)
#include
using namespace std;
void Mearge(int arr[],int st,int mid,int end){
int i = st,j = mid+1,ptr = 0;
// an array to store the sorted elements
int temp_arr[end-st+1] = {0};
while(i
One who explainef recursive call.
Sir yeh dono algorithm likhne hoge exm me merge sort
Dhanyawad sir 🙏🏻
You're welcome, Raghav. Keep learning, supporting & stay connected for more content👍
Here sir is matching with scientist John von newmann
Happy Teachers Day.
Hello sir,
Sir aap for loop se complexity kaise calculate krte ho... Wo sahi se samjh me nhi aa rha he... Kya aap yeh sahi se samjha sakte ho ki while , for, nested if, nested loop se kaise complexity calculate kre?
Thanks
Quick sort please
Uploading very soon. Stay tuned!
Sir quick sort
Sir, I am IIT graduate and now I want to pursue M.tech from IIT
So my question is, do I have to appear in Gate exam?
Guide me please
10ve sheetal naath ji
// C program for Merge Sort
#include
#include
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l,
int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
// Create temp arrays
int L[n1], R[n2];
// Copy data to temp arrays
// L[] and R[]
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
// Merge the temp arrays back
// into arr[l..r]
// Initial index of first subarray
i = 0;
// Initial index of second subarray
j = 0;
// Initial index of merged subarray
k = l;
while (i < n1 && j < n2)
{
if (L[i]
No Mic was destroy to make this video
use a better mic sir