All Sorting Techniques with clear explanation

Watch all sortings with clear explanation in the following link..
www.udemy.com/...
Watch this playlist for Placements related training videos in the following link
• Top 100 MCQs in C ("Wa...
Watch 50 more MCQs in the following link....
• Top 50 MCQs in C
Best way to understand Patterns in C
• patterns in C - Tips a...
Watch design and Analysis of Algorithms in the following link.
www.udemy.com/...
Watch "Best Loop programming and Patterns in C- Tips & Tricks " in the following link...
www.udemy.com/...
Watch Formal languages & Automata theory in the following link
www.udemy.com/...
You can watch "Tricky 150 mcqs in C" in the following link
www.udemy.com/...
Technical lectures by Shravan Kumar Manthri.
Watch Technical C programming
• Technical C coding : p...
Watch Data Warehousing & Data Mining
• 1. Multi-Dimensional ...
Watch Design & Analysis of Algorithms
• 1. Introduction to the...
Watch Formal Languages & Automata theory
• 1. Introduction to Aut...
Visit us: www.csegurus.com
Contact me @ fb : [e-mail]
Like us on fb: CSE GURUS
This video explains "All Sorting Techniques" related to Concepts in C . #ShravankumarManthri#CSEGURUS

[@freecoder522]

you the best teacher .......................

[@CSEGURUS]

very great to hear...Watch Top 90 Data Structures MCQs in the following link...
th-cam.com/video/i2LTAJhkFf8/w-d-xo.html

[@smilemania5102]

U r great 🙏🙏🙏 sir

[@CSEGURUS]

Thank u...Watch Top 90 Data Structures MCQs in the following link...
th-cam.com/video/i2LTAJhkFf8/w-d-xo.html

[@mainakchakraborty8795]

Sir please make video on 100 mcq for data structures and algorithms.

[@CSEGURUS]

It vl be recorded and uploaded in the month of June.

[@mainakchakraborty8795]

@@CSEGURUS thank u so much sir it will be very helpful to us

[@malubalumbwe]

Really helpfull🤝

[@CSEGURUS]

Glad to hear that...You can watch this playlist for placement related stuff in C
th-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html

[@Wolfiie95]

//2-6

[@venkatakrishnan8106]

i think your algorithem is wrong,kindly check it
here is mine
void bubbleSort(int arr[], int length)
{
_Bool isSorting = 1;
for (int i = 0; i < length && isSorting; i++)
{
isSorting = 0;
for (int j = 0; j < length - i - 1; j++)
{
if (arr[j] > arr[j + 1])
{
swap(&arr[j], &arr[j + 1]);
isSorting = 1;
}
}
}
}

[@CSEGURUS]

Its not wrong. Checkout one more time.

[@venkatakrishnan8106]

@@CSEGURUS in your function the 2nd for loop will always run but the if condition alway fail ,that what i was saying
consider the sorted array
1,2,3,4,5
count++ in the 2nd for loop ,not inside the if condition ,your's will run , and count will increment .
am i right ?

[@venkatakrishnan8106]

in special case
1:04:43
your flag variable is inside if condition(which always false for sorted array),
But it should be outside the if condition and inside the 2nd for loop,
so the complexity will be n

[@CSEGURUS]

I have written the same right? " flag==0" is outside j loop and inside i loop .