Sorting Algorithms L-1 | Bubble Sort | Data Structure | GATE-2023 | Vishvadeep Sir

[@rohitshorya7809]

At Timestamp: 1:04:00.
The flag variable must be declared inside the first for loop and before 2nd for loop.
void bubbleSort(int arr[], int n)
{
int i, j;
int flag ;
for (i = 0; i < n-1; i++)
{
flag = 0;
for (j = 0; j < n-i-1; j++)
{
if (arr[j] > arr[j+1])
{
swap(&arr[j], &arr[j+1]);
flag = 1;
}
}
if (flag == 0)
break;
}
}

[@sukhdevsharma5611]

shi kaam to kr rha h bhai...tu dimag chla rha h itna

[@sukhdevsharma5611]

whi declare hua h dhyan se dekh...

[@sangharshnagdevte5629]

Teaching style is awsome

[@swapnilsamanta1244]

Enjoyed The Lecture.....

[@athiyanavneeth7152]

Bahut dhanyavad 🙏🙏🙏

[@RakeshKumar-mt9fv]

Thankyou sir for such an amazing explanation

[@sanikasapkal1301]

Please upload remaining DSA topics lecture sir🙏

[@addhyay_]

Starts from 5:45

[@manojpalariya3150]

Sir can I get PPT of these videos? I have checked telegram group but didn't get there.

[@arinbagul4552]

Sir where I can get the PPTs of these videos, can't find on telegram. BTW AWESOME VIDEO👌

[@manojpalariya3150]

PPT mili aapko??

[@Jerry-wc3mk]

noice

[@athiyanavneeth7152]

Bahut dhanyavad 🙏🙏🙏