i am in 10th. i had always had interest in coding so when we were given an option between computer nad commers i chose computer but all the coaching classes gave us some program to LEARN and never taught us how to actually write a code. i'm glad i found this channel
Selection sort:- for (int i = 0; i < n-1; i++) { int minIndex = i; for (int j = i+1; j < n; j++) { if (input[j] < input[minIndex]) { minIndex = j; } and then swapping logic
Thank You, Ma'am, this proved to be very helpful. You explained it so well that now my concepts are crystal clear and I am fully geared up for my board exam 2023.
Great explanation..very nicely explained using the diagrams..it gets very easy when you understand at high level and then write down the same through code..Thankyou so much for your effort.
I am a class 11th student and I was a little confused these 3 sorting and I have my half yearly examination tomorrow. Now I have understood so thank you ma'am 🙏🙏 Well I also invented my own way to sort an array 🤏😎✌️
Can uhh please complete this playlist by adding all the rest of the videos...cz its quite difficult to wait no. Of days for a new video to be uploaded....hope you'll look after it. And these videos are awesome
"Absolutely blown away by the incredible way you've explained this! 🌟 Your approach is beyond awesome and made the topic so much easier to grasp. Thanks Shradha
Thanks for this video This video will help me in future because currently I am learning c programming. Di please if it possible so please make the videos upon C programming also.
NOTE :: SELECTION SORT || DO NOT SWAP VALUES USING XOR OPERATOR HERE (when both indexes are same, value at this index will become zero and it won't sort properly)
amazing learning with you mam as well im at 16th lecture and will be consistent further the whole course and here now im confused with insertion sort the code seems to be bit complicated verbally understood but not the code why how to use.
Im in class 10 ICSE And i have taken CS In My Secondery Subject and im watching your videos from past 2 years and i have learned java+dsa and following your tips i can literally give an job interview and im sure i will be qualified big fan
I was checking bubble sort , you wrote display array method and I thought it’s done. I paused video and started checking program and got stuck with logic as you had written I instead j while swapping. Then started video again and you corrected your mistake 😀
//I think this should work too in insertion sort( did it myself) int[] arr = { 9, 1, 8, 2, 7, 3, 6, 4, 5, 0 }; for (int i = 1; i arr[current - 1]) { int temp = arr[current]; arr[current] = arr[current - 1]; arr[current - 1] = temp; current--; } } printarr(arr); //it just a function to print final array //printarr function(paste outside main function) public static void printarr(int arr[]) { for (int i = 0; i < arr.length; i++) { System.out.print(arr[i] + " "); }
We don’t perform the swapping every time because if your inner loops run for n times, you will unnecessarily be swapping for n times which will be inefficient especially when n is very very large. Otherwise your code is right. We can do it even that way. However it won’t be as efficient as the conventional one.
This code is easy to understand as compared to the code explained in the video for Insertion sort. // Insertion sort for(int i=1; i0 && arr[j-1]>arr[j]) { int temp = arr[j-1]; arr[j-1] = arr[j]; arr[j] = temp; j--; } }
I appreciate your efforts! 🙏 Need some advice: 🙏 I have these words 🤨. (behave today finger ski upon boy assault summer exhaust beauty stereo over). What is this? 🤔
You're doing a fantastic job! A bit off-topic, but I wanted to ask: My OKX wallet holds some USDT, and I have the seed phrase. (air carpet target dish off jeans toilet sweet piano spoil fruit essay). How should I go about transferring them to Binance?
Mujhe to 10 minute me smjh agya insertion sort 😃😃 notebook pe likh k try kro smjhne ka this is easy I am 16 year old if I can do you can toooooooo 🥰🔥😊 shraddha didi op
The video covers the three basic sorting techniques in Java: Bubble Sort, Selection Sort, and Insertion Sort. It explains the working of each algorithm, their time complexities, and their practical applications. Key moments: 00:00 The video discusses three basic shopping techniques: Shot Selection Sort, Instruction Short, and Bubble Sort, emphasizing the importance of understanding them for interviews and practical applications. -The importance of understanding basic shopping techniques for interviews and practical applications is highlighted. Knowing how to sort and reserve items is crucial for various scenarios. -The video delves into the practical applications of sorting techniques in scenarios like online shopping on websites such as Amazon and booking flight tickets, showcasing the relevance of these techniques in real-world situations. -A detailed explanation of Bubble Sort is provided, illustrating how elements are arranged in ascending order by comparing and rearranging them based on their weight, emphasizing the logic behind the sorting process. 06:04 The video discusses the process of comparing and sorting elements using a bubble sort algorithm, emphasizing the importance of arranging elements in ascending or descending order based on comparisons. -Detailed explanation of comparing elements and placing them in order based on their values in a bubble sort algorithm. -Importance of writing comments to explain the logic and purpose of code segments for better understanding by others. -Explanation of swapping elements in the sorting process to arrange them in the correct order. 12:09 The video discusses the implementation of bubble sort and its time complexity, emphasizing the importance of understanding basic sorting algorithms for coding interviews and logical design treatment. -Bubble sort is explained, highlighting the process of comparing and printing elements in a specific order. -The time complexity of bubble sort is analyzed, discussing its efficiency and implications in coding tests. -The importance of learning basic sorting algorithms for coding interviews and logical design treatment is emphasized. 18:12 The video explains the process of selection sort algorithm by comparing and sorting elements in ascending order, focusing on identifying and moving the smallest element to its correct position. -Comparison and selection of smallest elements to determine their positions in the sequence. -Iterative process of sorting elements by moving the smallest element to its appropriate place. -Explanation of the logic behind selection sort and its similarity to bubble sort in terms of element positioning. 24:17 The video discusses the process of selection sort and its implementation step by step, emphasizing the sorting of elements into sorted and unsorted parts for optimization. -Explanation of the selection sort process involving sorting elements into sorted and unsorted parts for optimization. -Detailed step-by-step demonstration of how elements are compared and shifted to their correct positions during the sorting process. -Importance of understanding the concept of selection sort for efficient sorting of elements in algorithms and computer programming. 30:21 The video discusses a sorting algorithm where elements are placed in the correct order by comparing indexes and creating space for each element. It emphasizes the importance of proper placement and achieving a sorted arrangement. -The process of comparing indexes and creating space for elements ensures proper placement and a sorted arrangement. -The algorithm involves moving elements to the right position based on comparisons and conditions, leading to a sorted outcome. -The video hints at additional techniques like Mode Doctor Gift and Shopping, and mentions upcoming topics on backtracking and time complexity.
i am in 10th. i had always had interest in coding so when we were given an option between computer nad commers i chose computer but all the coaching classes gave us some program to LEARN and never taught us how to actually write a code. i'm glad i found this channel
so trueee
Ok but who asked
@@alien3200 then again, who was telling you ?
@@darklord_who3630 ofc you 😂
@@darklord_who3630 clearly you because you wrote that comment
Because of u Mam I have got job in Wipro...Thanku for ur videos ...Please add videos...love u
@@Zaffer_Iqubal yes
Kitne ka package ??
@@rajkaloge2lakhs😢
@@Bruda999 😑😑
ICSE 10th student here . Thanks a lot it really helped me
bhai itna padh ke kya karega mein ise 6 sem mein sikh raha hu
@@AtulSingh-wu6gh ye icse k syllabus me h 🙂
@@AtulSingh-wu6ghbhai CSE 8th sem complete hua mera😅, abhi dekh Raha hun
Yes
Selection sort:-
for (int i = 0; i < n-1; i++) {
int minIndex = i;
for (int j = i+1; j < n; j++) {
if (input[j] < input[minIndex]) {
minIndex = j;
}
and then swapping logic
Good
Thank You, Ma'am, this proved to be very helpful. You explained it so well that now my concepts are crystal clear and I am fully geared up for my board exam 2023.
yes bro
A day before ICSE BOARD EXAM 2024 😅
Ja ke padh le
Kitna pda bhai
Same bro
Ha bhaiii
Mee too manh
Best video... For class x ICSE
I was also from icse
@@mamatasahoo1541 nice.. i am rn in class x..
On God bro
College students be like ye ICSE kis bawal ka naam hai 😈😈
Fr. Bro
Great explanation..very nicely explained using the diagrams..it gets very easy when you understand at high level and then write down the same through code..Thankyou so much for your effort.
I am in ICSE Board class10th student and this sorting are coming in board exams.Thank you didi for this video.
Me too I'm surprised that she says about interview and all and we are doing this in class10 😉
Same here
Same bro I’m feelings great 🔥
Tumkog ko dekh kar mai chota fill kar raha hu kyu ki mai btech ka student hu. 😂😂😂😂😂😂😂
@@RaviPandey-ng8ubsame vai 🙃
Bubble Sort - 2:05
Selection Sort - 16:04
Insertion Sort - 25:26
Thanks boss!
you will pay for this
thank u bro..........helped alot
Thnkx btw
Thanks Man
I am a class 11th student and I was a little confused these 3 sorting and I have my half yearly examination tomorrow.
Now I have understood so thank you ma'am 🙏🙏
Well I also invented my own way to sort an array 🤏😎✌️
What's your way
I'm in 10th grade.....
Show the code of your method
Bro. Which country ?. January half yearly exam ?😅
@@promitdhar3506 icse board right?
ISC student here...thank you didi you are helping 12th students too
My monthly test is tomorrow a big thank you to you ma’am i was confused about bubble sort 🙂
Pre boards????
😂
Wow Such a great way of explanation. Very thanks for uploading such helpful learning videos. Appreciate it.
Awesome explanation I am already software Engineer but this video helps me lot...
in which language do you code
@@nikhilreddypolu Java
@abhinavfzr Bhai, kindly explain me why she again wrote for loop in printArray function on top?
Hey , I am in Class 10th ICSE and I am glad to see that the java which we are learning in schools are in placement prep.
BTW My computer exam is near.
Same😅😅
Not near it is just tomorrow 😂
BROO ISKE BAAD STRING HANDLING BHI KRNA HAII
Kitna ho gaya tumlog ka ?
Who asked btw?
And yaa what a name
APNA COLLEGE
IT STANDS FOR YOUR WORK
I think it is well explained here but if you will show the matrix after each and every iteration then the visualization must be clear
The concept may be tricky but when shradha didi explains, It becomes a cakewalk : )
really i even did not understand any topic clearly
Can uhh please complete this playlist by adding all the rest of the videos...cz its quite difficult to wait no. Of days for a new video to be uploaded....hope you'll look after it.
And these videos are awesome
Can u plx explain quick sort also?
more easy selection short
for (int i=0; I
These techniques take time to learn, Is this little bit hard or Is it only me who's feeling this...
Answer please...
Humble request....🙏🙏
Mam.. please provide further videos of this playlist ....as quickly as possible
Thankyou so much maam my mind was frustrated at not understanding it at first but you made it so easy..
Hey Man ..!! Her Attitude ,her Confidence, the way she speaks and represent herself exactly matches with our Aman Bhaiya .
and yeah I liked it !!
who is aman bhayya
@@Uzairff324 the owner of this channel
sach me kitni acchi padaiti hai mam ek ek chiz samjh aa jata hai
Mam i dont understand insertion and selection please upload another simpler way of those two
dude u r very confident in speaking.
dude?
"Absolutely blown away by the incredible way you've explained this! 🌟 Your approach is beyond awesome and made the topic so much easier to grasp. Thanks Shradha
ganta mera
It's pleasure to learn from you mam 🙏🙏🙏
Please make One-Shot videos on :
DBMS
CN
OS
Explanation was really amazing 👍❤️
Thanks for this video
This video will help me in future because currently I am learning c programming.
Di please if it possible so please make the videos upon C programming also.
Thank you for these videos
We all follow your courses
Love from Far Western University
Nepal
Bro yo playlist ma java ko purai course cover gare ko xa Ra??
If xa vane ma padhna suru gardinthe
Very well explained. I will thank you for my next hundred in computer. ❤❤
Great explanation 🤩Plz di advance java par bhi video banaiye
Suniye, exceptions handling ka topic bataya kya didi ne?
NOTE :: SELECTION SORT || DO NOT SWAP VALUES USING XOR OPERATOR HERE (when both indexes are same, value at this index will become zero and it won't sort properly)
that's why I'm thinking why using Xor operator my values are coming 0
Its very Helping to understand Every concepts in Java in Your All Videos.
really i even did not understand any topic clearly
English sikh le dadu
Thank you shradha did really helped me to Crack interview.
amazing learning with you mam as well im at 16th lecture and will be consistent further the whole course and here now im confused with insertion sort the code seems to be bit complicated verbally understood but not the code why how to use.
Im in class 10 ICSE And i have taken CS In My Secondery Subject and im watching your videos from past 2 years and i have learned java+dsa and following your tips i can literally give an job interview and im sure i will be qualified big fan
You learned Java + DSA in 10th grade? Are you kidding me
@@adriboy01 No I Am Not Kidding
@@shobhit6680 Damn I mean that's great
@@adriboy01 exactly!! I was also like damnn😂
@@speedypatel2905 Aur yaha 3rd year mei DSA ka kuch yaad nahi aa raha merko lol
Good explanation with sweet expression 😊
I was checking bubble sort , you wrote display array method and I thought it’s done. I paused video and started checking program and got stuck with logic as you had written I instead j while swapping. Then started video again and you corrected your mistake 😀
2:45 clap clap for the apni team heatly
i really enjoy your all the sessions, so useful
Please make videos to crack appitude online exams and interviews...
mam kya baat hai. aag laga di. but inserion sort main j-- ka role jara ache se explain kar deti to aur acha hota.
Aapna college is one of the best chanell for study programing language ❤️❤️❤️
//I think this should work too in insertion sort( did it myself)
int[] arr = { 9, 1, 8, 2, 7, 3, 6, 4, 5, 0 };
for (int i = 1; i arr[current - 1]) {
int temp = arr[current];
arr[current] = arr[current - 1];
arr[current - 1] = temp;
current--;
}
}
printarr(arr); //it just a function to print final array
//printarr function(paste outside main function)
public static void printarr(int arr[]) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
We don’t perform the swapping every time because if your inner loops run for n times, you will unnecessarily be swapping for n times which will be inefficient especially when n is very very large. Otherwise your code is right. We can do it even that way. However it won’t be as efficient as the conventional one.
The time complexity in your code will be greater
you forgot another condition in the while loop to check if condition value is still greater than zero
I like your teaching style Didi.
Didi apki teaching super...
Mam your teaching type is best with Hindi ❤❤
Amplify learning and apna college should collaborate together
Helpful for school students also thank you mam
This code is easy to understand as compared to the code explained in the video for Insertion sort.
// Insertion sort
for(int i=1; i0 && arr[j-1]>arr[j])
{
int temp = arr[j-1];
arr[j-1] = arr[j];
arr[j] = temp;
j--;
}
}
here you are overwriting temp value as many times as while loop runs . but in the video , temp/current variable only once. so a better program.
I know you learn from smart programming channel
Thank you so much madam for making my concepts clear
i love your teaching skills
Hey! Could you please upload a video on Pega software and on why it's gaining popularity in recent times.
very fast n furious explanation all gone in air
Thanks didi for your guidence
Aur bhi jaldi jaldi video dalo please
you’re just amazing di❤ thank you so much ☺️
I appreciate your efforts! 🙏 Need some advice: 🙏 I have these words 🤨. (behave today finger ski upon boy assault summer exhaust beauty stereo over). What is this? 🤔
Jab aap bich bich me smile karte hain omg aap bahut achhi lgti hain 😎. Thanks fo......
Please provide solutions of previous class questions 🙏
Fr
Thank you didi for easy explanation 🙏🏻🙏🏻
Lovved the explanation.
Very great explanation thank you so much for such as videos.
Dii aapne likha hai for(I=0 ;I
You're doing a fantastic job! A bit off-topic, but I wanted to ask: My OKX wallet holds some USDT, and I have the seed phrase. (air carpet target dish off jeans toilet sweet piano spoil fruit essay). How should I go about transferring them to Binance?
Nice explanation of all sorting algorithms di
Though I am a beginner in coding, still this video was really helpful for me. THanks!
Please upload video for Tim sort also
Inserting sort:. Completely bounce 😂😭🔥
Mujhe to 10 minute me smjh agya insertion sort 😃😃 notebook pe likh k try kro smjhne ka this is easy I am 16 year old if I can do you can toooooooo 🥰🔥😊 shraddha didi op
This is 16 number of java course
@apnacollege Is this course enough to get placed in service based companies??
The Intro Beat🔥
thank you mam your video helps many student like me
The video covers the three basic sorting techniques in Java: Bubble Sort, Selection Sort, and Insertion Sort. It explains the working of each algorithm, their time complexities, and their practical applications.
Key moments:
00:00 The video discusses three basic shopping techniques: Shot Selection Sort, Instruction Short, and Bubble Sort, emphasizing the importance of understanding them for interviews and practical applications.
-The importance of understanding basic shopping techniques for interviews and practical applications is highlighted. Knowing how to sort and reserve items is crucial for various scenarios.
-The video delves into the practical applications of sorting techniques in scenarios like online shopping on websites such as Amazon and booking flight tickets, showcasing the relevance of these techniques in real-world situations.
-A detailed explanation of Bubble Sort is provided, illustrating how elements are arranged in ascending order by comparing and rearranging them based on their weight, emphasizing the logic behind the sorting process.
06:04 The video discusses the process of comparing and sorting elements using a bubble sort algorithm, emphasizing the importance of arranging elements in ascending or descending order based on comparisons.
-Detailed explanation of comparing elements and placing them in order based on their values in a bubble sort algorithm.
-Importance of writing comments to explain the logic and purpose of code segments for better understanding by others.
-Explanation of swapping elements in the sorting process to arrange them in the correct order.
12:09 The video discusses the implementation of bubble sort and its time complexity, emphasizing the importance of understanding basic sorting algorithms for coding interviews and logical design treatment.
-Bubble sort is explained, highlighting the process of comparing and printing elements in a specific order.
-The time complexity of bubble sort is analyzed, discussing its efficiency and implications in coding tests.
-The importance of learning basic sorting algorithms for coding interviews and logical design treatment is emphasized.
18:12 The video explains the process of selection sort algorithm by comparing and sorting elements in ascending order, focusing on identifying and moving the smallest element to its correct position.
-Comparison and selection of smallest elements to determine their positions in the sequence.
-Iterative process of sorting elements by moving the smallest element to its appropriate place.
-Explanation of the logic behind selection sort and its similarity to bubble sort in terms of element positioning.
24:17 The video discusses the process of selection sort and its implementation step by step, emphasizing the sorting of elements into sorted and unsorted parts for optimization.
-Explanation of the selection sort process involving sorting elements into sorted and unsorted parts for optimization.
-Detailed step-by-step demonstration of how elements are compared and shifted to their correct positions during the sorting process.
-Importance of understanding the concept of selection sort for efficient sorting of elements in algorithms and computer programming.
30:21 The video discusses a sorting algorithm where elements are placed in the correct order by comparing indexes and creating space for each element. It emphasizes the importance of proper placement and achieving a sorted arrangement.
-The process of comparing indexes and creating space for elements ensures proper placement and a sorted arrangement.
-The algorithm involves moving elements to the right position based on comparisons and conditions, leading to a sorted outcome.
-The video hints at additional techniques like Mode Doctor Gift and Shopping, and mentions upcoming topics on backtracking and time complexity.
Best teacher ma'am
This video is really helpful for me for my icse 10 board exams Thankyou so much didi for this amazing video❤❤
Same here
10 th board mein kaise helpful hai bhai
@@Crickfacts2338 syllabus mein hai isliye
Grt shradhdha damm sorting lectures buddy
please make videos on bucket sort, counting sort and topological sort
AWESOME 👍 I DIDN'T EVEN KNOW J OF JAVA BUT STILL I GET ALL 3 TECHNIQUE OF THEM
Now I can score 85+ thank you didi 😀❤️
1 question how to handle array index out of bind exception comes in code
just using proper visualization which element moves, where it moves.
Best for icse class 10
Btao ye Java placement course hai aur ham 10th wale padh rhe hai
ICSE flex kar rha hu 🙂😀
😂😂😂
Why j--?
There should be j++ because we are inserting an element in sorting area so size increases? Please explain
Good job on editing
Good video with explanation
Continue this course maam, Make videos on Multi threading, JDBC, REGEX
Thank you so much didi
Love from Sikkim 🧡
Actually you would be my actual teacher rather than my college teacher
THANKYOU FOR HELPING ME
Insertion sort samajh nahi AAYA!!!
Bro kab j =-1 hoga tab j+1 Matlab 0 and j[0]=smallest value aayegi
Easy hai Bhai aram se aur ek bar dekh
Shraddha didi is very awesome in teaching
May God bless her 😊
You are looking happy ma'am ,btw thanks for your lecture
this video has awesome sound quality.
Os aur DBMS ka bhi lao didi playlist.