Quick Sort For Beginners | Java Placement Course |
HTML-код
- Опубликовано: 10 сен 2024
- Notes : drive.google.c...
🔥Java Placement Course : • Introduction to Java L...
🔥Complete C++ Placement Course (Data Structures+Algorithm) : • C++ Full Course | C++...
🔥Telegram: t.me/apnikaksh...
🔥Instagram: / dhattarwalaman
My RUclips Gear 😉: docs.google.co...
i must have seen thousands of videos but the way this girl explains all the concept with such an ease.....she's great!!!!
Yaa✅
Yes😊
Hi can we talk please...
Great explanation.. I have 2 points though...
1. Unnecessary swap during comparison loop
If an element is already in its position, the code will swap an element with itself...
Swap only if(i>j)
2. Pivot swap is not necessary if pivot is already in place
So there can be also if(i
I didn't get it can u please explain it with example
@@yashyy397 time at 16:40
can you fix it ?
Aap kahaan the gyani baba😂😂😂😂thankuuu
same doubt arised bro
Iss didi aur aman bhaiya ke kripa se hum bohot kuch free of cost sikh rege hain😀
Free ka gyan in the end quick sort or merge sort Kab used krna chayie
Paid course khareed le muftkhor bangali
Iss dedi nhi bhai Shradha dedi
Sun aman jiju bol, agar shrda didi h to, ok
@@johnhammond3605Bhai bahi😅😅😅
Very nice explanation and loved the last part where it has been explained which sort to use under which circumstances. Being from embedded systems platform, quick sort is better than merge sort because memory constraints are always there in microcontrollers. Thank you so much for this video.
Superb and amazing 💗 course bhaiya aur didi
Proud to be have a great guide 😊 in you
A big thank you for this JAVA series . Can't thank you enough for this course please keep this series going on . It's so helpful . I randomly landed on your videos due to a learning nessesity and I am finding it damn helpful .
Yes you are right
Waoo explanation level is too good..
I was so worried about quicksort.. But now you cleared my doubt.
Thank you mam for this wonderful explanation. ❤
It helped me to much.
if u understood, then try to explain this {3,2,6,5,8,4}
Code :-
public class QuickSort {
public static void quickSort(int[] arr,int low,int high){
if(low
1. Roadmap, goals
2. Independent self reliant
3. Patience 🙂
4. Mentorship
Thanks for making this course,this helped me a lotttttt.
In so many videos they said that i need to cross j then that i will be pivot value , it's true , but coding According to that is complex one , but mam u made it veryyyy simplified way and u made a simple code for this complex , really an excellent work mamm👍👍😍........
Hello Aman Bhaiya,
There are few more concepts that we need as in college as professional, if possible if you can make video on these concepts of Java:
Java API Packages
Multi threaded programming
Managing Error and Exception
Managing I/O Files
Java Collection
Applet Programming
AWT
Event Handling
JavaFX
JDBC
Java Networking
Thank You
This series is really great and a great apportunity for us to learn dsa with Java.
One request to Apna College team to please make video fast and upload within 1 to 2 days.
Thank You ❤️
The quality of course is superb. Thanks Shradha. Request you to post the lectures regularly and if possible provide the roadmap of lectures
Continue the series don't stop.......it has been 10 days for the last videos.......this much gap is spoiling the placement activity
if you are really serious for placement then join apna college alpha bootcamp
Didi Plz Make A Video On How To Study When You Don't Feel Like Studying 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
never thought quick sort is this easy. thank u big sis for making this
Didi aap ki java classes sbse best h non tech student bhi java expert bn jayenge.
Thank you soo much I was always wondering that why quick sort is so tough but after watching that video it became a cake walk for me
Low and high ka index to dia nhi hamne,,
And it is showing error on first line
public class QuickSort { wali line me
5:25 "Greatest Life Lesson"
I got it
Should be coming from one who is double😂
ayooo what :)))
Ma'am in "partition" function it must be j
I was worried for my exams because I couldn't find any video to solve my main concept of sorts and suddenly I got this , now I got a relief...
A great thanks to you guys for the java , Web development , C++, Python along with DS+Algorithms .It's really so help full . Keep Develop yourself. Best of luck for the future.... :) :) :)🙂
Thank you so much ma'am love you so much 💗💗💗
Java language is very hard but i can learn java language because i whant to be en engineer tarefor i am learning english si anything is no more so , by by
thank you so much for making this corse I am not done till this video but I will 😁😁
Yaar yeh kitni awesome hai 🥺😂
Of course...Di is absolutely awesome
You explain like a WOW👍 #HATSOFF #AMAZINGTEACHER
Where is our jijashree💀⁉️
Mind blowing explain
God bless both of u didi or Aman bhaiya ❣️😚
bhaiya babhi bola kar
how to make the output appear in VS code as shown in this video at 18:39 ??
this output console shows output in a clear format and also the runtime of the program is visible !
My heart skips a beat after watching your smile ❤love
Tu vedio mtt dekha krr thik hai nn
@@Rahulyadav-vz5sj kyu
Please upload more video in java placements question as soon as possible🙏
You can also put if low== high ....
Then should return
Thanks for dark background....🙏
Thanks to you
Samajhh nahi aaayaa par sunke aaacha lagaa😂
nice explanation thanks
Maja aaya 👏👏
Allah Paak aap ko hamesha Salamat rakhe
ameen 👐
✧༺♥༻✧
Ameen
This is what I wanted code explanation
Mai computer science karna chahata hu or 12th mai it and computer science nhi tha or muje be tech karna hai computer science karna chahata hu please aage kya karne chaiye ispar ek video banayo please
Plz make a video on how to make a Compiler and . Extension
Thankyou mam ❤❤❤
shraddha mam you makes much cunfusion in int pivot = partition(arr,low,high) in
this step
Should I do BCA MCA integrated degree or should I do only BCA first than MCA .I'm very much confused . Please help me
Didi please make playlist of aptitude test for product based companies.
I. Love this Didi 😘😘😘😘 Didi you always motivated me
I know all languages off computer but I always love python coding is my favourite language ever
To ja krr python ka video dekh yha aane ki koi jarurt nhi hai..
2nd...
hii shradhha mam.when i exceute this program .it generate an error stackoverflow. how to sort out the output
Thank you for very esay prasentation ❤️
I really enjoyed the video. The way of explanation is awesome.
Didi you are great I love watching your video ❤❤❤
tht goosebuming video strng music❤
Extract all the vowels and consonants from your name and make a single
string of vowels followed by consonants in ascending order. For example, if
your name is “ALAN TURING” then the final string would be “AAIUGLNNRT”.
Plz answer reply me ma'am
import java.util.*;
public class ArrangeStringQ{
/*
Q. Extract all the vowels and consonants from your name and make a single String of vowels
followed by consonants in ascending order .
Example :- Input = "ALAN TURING"
Output = "AAIUGLNNRT"
*/
public static void main(String[] args) {
System.out.print("Enter Your Name : ");
Scanner sc = new Scanner(System.in);
String name = sc.nextLine();
String vowel = ""; // Used to store Vowels in ascending order
String arranged = ""; // Used to store arranged sequence.
name = name.toUpperCase();
for(char ch ='A';ch
import java.util.*;
public class Main
{
public static void main(String[] args) {
String s="Alan Turing";
s=s.toUpperCase();
s=s.replaceAll(" ","");
char arr[]=s.toCharArray();
Arrays.sort(arr);
int n=arr.length;
String v="";
String c="";
String ans="";
for(int i=0;i
#Apna College & shradda Didi rocks
Thanks for the great explanation
Is there a particular time period when new lecture gets uploaded ??
Hello
Mam good work
Needed for all
Thank you soo much didi 🔥
The quality of course is superb
Plz do a video on QUICK sort by DUAL Pivots 🙏🏽🙏🏽
I request didi please complete this series as early as possible because my placements are going on and I am learning DSA from this series.
I have never watched a video like this one. ☝️ 😍😍😍
Please upload more and more videos.
Quick, merge, & etc sort are necessary for programming where it is used sort cheapeter I know very well
5:21 must watch
sout("I like that moment");
Tank you
Didi doesn't it works like binary search or can we say it works on the same principle of binary search like dividing and then doing the operation.
I wish she would have solved the challenge in javscript
Hii
I love you didi ..you teach really awesome 😎
Don't know why but Aman sir and didi both teach in kind a similar accent and vibe 🙃
nice explanation shraddha di
Thanks for amazing explanation
Hey please make a series of important series of questions for each video its my request
Didi.. ek video JVM Architecture pr banaiye.. JVM kam kese krta h ye samajh lenge to or easy ho jyega
Nhi krvaya jaye ga tu kya krr lye ga..
Didi Always JOd💪💪
*Please make a video for computer science class 12 term 1* 🙏
Mam
Overpowered intro
Thanks mam for making these videos.
in swapping pivot why can't we write like this :
int temp = arr[i];
arr[i] = pivot;
pivot = temp;
return i;
i am not getting the appropriate ans output
She has written that.
Pure content
Remembering Ross saying pivot in friends
thank you didi so much
Many advance concept of JavaScript is pending yet(Promise, async, await, callback). Please make videos on Advance JavaScript also.
excellent
Thank you so much for this!
public class QuickSort {
public static int partition(int []arr,int low,int high)
{
int pivot=arr[high];
int i=low-1;
for(int j=low;j
please make a full tutorial on django and angular
one of the easy code #include
using namespace std;
int helper(vector &v, int s, int e)
{
int pivot = v[e];
int i = s;
for (int j = s; j < e; j++)
{
if (v[j]
Very well explained mam
6:12 to 6:25 ....quick sort complete
This code is not working when the array is in strictly descending order like ( 5, 4, 3, 2, 1). It gives ArrayIndexOutOfBounds Exception.
I have tried other QuickSort implementations but no one works for the strictly descending array.
Please tell me its solution.
yaa you are right bro but ye sorted array pe vo kaam nhi krta hai kyu ki quicksort already soretd array ko sort mhi kr skta hai , jb hum quick sort ka base condtion likhte hai tb (low< hight) krte hai tb hi vo array ko sort krta hai , higher wale bde element pe quicl srt kam nhi krega
di quick sort in C++ ki video banao
5:21 wah api g🤣🤣
Shabash .. mast samghati ho aap
Didi quick short ko kya ham ascending order bhi khe sakte hai ye jo elements apne arrange kiye the ascending order mein the isiliye
no you can arrange them in descending order also by making changes in code