Lecture 21: Insertion Sort with Theory and Code
HTML-код
- Опубликовано: 4 окт 2024
- What is Sorting in C++
Insertion sort in C++
Insertion sort with different approach
Bubble sort:
Day 29/180, #180daysofcode #180 hard
We have made a whole video in c++, How to solve pattern print problem. We explained everything with the help of code.
We are doing 180 days challenge and going to complete the whole course within the duration with quality content on RUclips. I am on the mission to create a tech revolution in our country and in upcoming future we want to create a tech which will create many jobs in India.
Video will come on Mon-Fri at 6am in the morning
Join Our Whatsapp Channel: whatsapp.com/c...
CoderArmy Website (Buy premium feature at 99 Only for 6 months): www.coderarmy.in
Premium Feature includes:
1: Doubt Support
2: Mentorship session
3: Placement Support to Top Students
4: Resume and Linkedin Profile Building
5: Coding contest twice a month
6: Course completion Certificate
7: Home work Discussion
HomeWork Sheet: drive.google.c...
DSA Course for free
C++ Free Course
Rohit Negi DSA Course C++
Coder Army DSA Course c++
Function in C++
Pass by value.
Pass by reference
C++ important topics
connect to me on Instagram: rohit978.page....
Linkedin: rohit978.page....
Telegram: rohit978.page....
Hello Coder Army, Welcome back to 5th week....
Good Morning Bhaiya
Good morning bhaiya
Bro I am one of your subscriber from AP and my mother tongue is Telugu. I am interested to follow your classes but not getting the language .can you please provide English subtitles so it will be more beneficial to students like me please respond bhaiyaa
#coderarmy
Gm bhaiya ❤
Big thanks for the awesome free DSA Course! Your teaching rocks, and you're making learning super fun and easy. Appreciate your generosity! 🙏❤️
Day 27 done and dusted..... Best explaination ever....Thank you bhaiya... #consistency
Thank You Bhaiya for providing us the best DSA lecture.
Welcome
Hello bhaiya , thank u so much
Insertion and sorting in array college me teacher ne padaya tha sur ke upar se gaya tha but ab chote chote vo sare concept clear ho rahe hai ❤❤
bhaiya shi bole to ap se padh kr coding me maza ane lga hai ap ache se explain krtea ho thank🥰🥰🥰🥰
Bro You are providing very good content to improve for Indians who didn't get knowledge in collage because of wrong faculty
I am here for a revise of this concept ❤ no body can teach better than you. You can explain complex topics in a very easy way. Thank you Rohit Negi bhai . You are the best ❤
Success wahi hoga bas Jo end Tak tikega 🔥👍
To fir ready ho ? 😂
homework : insertion sort(increasing) sorting from last.
code :
#include
using namespace std;
int main()
{ int size, i, j;
cout size ;
int arr[size];
cout =0 ; i--){
for(j=i ; jarr[j+1]){
swap(arr[j],arr[j+1]);
}
else{
break;
}
}
}
cout
Bhaiya can you take questions directly from the coding platforms like leetcode geeks for geeks like you did in one of the videos that is really good way of learning and we all can be comfortable in coding platforms also btw thanks for the amazing course☺️☺️☺️🙏
Bhaiya aapke videos pe like aaye chahe nii views aaye chaye nii but you are best teacher and whatever you are giving in this costly world it's amazing for all of us aspirants❤❤❤
Thankyou bhaiya
love you from Uttarakhand techmcu
Crystal🔮 clear bhaiya.... ❤
Keep it and All the very best!
Lecture 21 completed ✅
1 week of DSA completed now 2 week started
Thankyou bhaiya ❤❤
Keep going
HW Solution 2 : Insertion sort from right side
for(int i=n-2; i>=0; - - i)
{
int j = i;
while (arr[j] > arr[j + 1] && j < n - 1)
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
j++;
}
}
Thanks a lot bhaiya
Please put the time stamps .....much request it will be more helpful
Thank you bahiya for this amazing course ♥
Thanks sir your teaching method is very gorgeous ❤❤❤
It's around 03.00 AM, finally successfully completed these 21 videos ... Thank you Bhaiya .....
Good Job bhai
lessgooo one more lectue completed with HW
aaj ka taget poora binary search❤
Chamka bhaiya chamka 👍🏻
Best Explaination I have ever seen,thank you bhaiya for this type of contents.😍
Thank you vaiya hamare liye itna sochne ke liye....😘😘😘
Bharat Mata Ko Ap pr Garv H mere bhai.
Great Explanation Sir🙏🙇♂✨💖
best dsa course there is
Day 29 ✅
Now completed because at early morning I was traveling
Thanks for the best content 🎉
First viewer
Bhaiya Kal aapka routine wala video dekh ker kaafi Acha or inspiring feel juaa
Great job, keep going...❤
beautiful lecture 😇😇
Bhaiya sayad aap mera ye cmt padho 🥺 ye course bhut mast hai I think ise koi bhi first, second ya third year wlaa kr skta hai 🙁 but bhaiya mai algorithm samjh leta hu aapse aur meko c++ bhi aane lgi sacu me 😅.... Subah subah ek lecture lo c++ seekho baki bhaiya mai 4th year me hu ❤ core language java but aapse padhne me maja aa rha kuch concept padh leta hu jaise sorting, searching🔍 ye sab thankuu bhaiya 🌟🌟🌟 I think you deserve more and more followers ❤🥰
Thank you so much
God bless u
Ok h bro sb. ❤❤❤❤.
Samajh aagya sb kuch ek baar video dubra dekhni pdi thodi c bich me samajh nhi aaya but ab sb clear h 🥰
L-21 done ✅
#29 out of 180
Ab coder / programmer👨💻 banana huwa aasan with rohit sir ❤❤
excellent simplistic analysis n perfect pace.
Awesome explanation...🎉
47:01
//THANK YOU SO MUCH BHAIYA
//INSERTION SORT INCREASING ORDER FROM LAST
#include
using namespace std;
int main(){
int arr[6]={8,3,1,6,4,5};
for(int i=5;i>0;i--)
{
for(int j=i-1;jarr[j+1])
swap(arr[j],arr[j+1]);
else
break;
}
}
for(int i=0;i
Very very thanks 🙏🙏🙏 for DSA series, batao chamka nhi chamka 😂😂
he he😁 ye bhi samjh gya🙂🙃
धन्यवाद sir🫡
2d array kb padhayenge ?
#180DaysofCode
Day - 29 Lecture -21
Successfully Completed ✅✅✅
Whorse increasing order insertion sorting
For(i=0;i0;j--)
{
If(arr[j-1]>arr[j])
Swap(arr[j-1],arr[j])
}
}
Bhai gajab padhte hai app thank you so much
Thanks Bhaiya...❤🎉
29/180 done
Thanku bhaiya🙃
Let's begin with 5th week !!!!
Awesome lecture bhaiya 😍 Thanks you
❤ 47:30
complted ✅✅✅✅
In the example if the array is [9 4 5 6 7] then the array will stop after 4>5 will not true and 9 will remain at index 0 . which is wrong. After sorting till 2nd index.
Day 21✅
Day 29 / 180 days complete done ✅✅✅✅✅✅✅✅
🏃♀Day 6✅
best
Done Bhaiya... 29/180 ✅
Day 29/180 completed
revising the concept
Day-29🔥 Completed
#180daysofcode
covering backlogs
❤
Thank you bhaiya .
Bhaiya I am covering these lecture and I also want to go for premium ,Is it still for 99.
day 21 is completed
Lecture 21 complete ✅
Day 29 Completed ✅✅💝💝💥💥
day29 completed, thank you bhaiya
2week completed bhaiya jee❤
Bhaiya G week me ek live class le lijiye jisme week ke sare homeworl discuss ho aur isse revision v tagdi wali ho jayegi..
ky kehte ho #coderarmy 💙💙
lecture 21✅
thanks for bheya
for provide dsa series 🤩😍🥰
Homework done
Thankyou Bhiya
amazing lecture with great explanation
grinding
Bhaiya ek request thi ki next sunday ko bit manipulation pe question kara dete
21 din 21 lec done ☑☑☑☑
Thankx bhaiya
Thank u sir😊🙏
Home work done
38:14 = code part
radhe radhe
aapke first code ke example mein 4 se pehle koi aisa number hota 5 se bada ho to ye code to galat hai
29/180 Day's full power full power ❤❤❤
Thanks Bhai ji
Great Explanation🔥🔥🔥
Gergeous lecture
Day 8/159
I think now you will raise the bar like anything
Together we will
Maintaining Consistency
Good morning bhai❤
Great
Good morning Bhaiya ❤
Thanks bhaiya ❤
💥💥💥
Full energy day 💪 😀 ❤29
Lecture 21 Check ✅
MAZA A GAYA DA
#Chamka Insertion is Sorted
Good Job Bhai, kaafi achee se padai kar rhe ho, keep it up
@@CoderArmy9 Bhaiya aapke saath kaam Krne ke liye skilled up ho rha hu.