- Видео 40
- Просмотров 8 675
Learn with Prerna Ma'am#PJ
Добавлен 18 ноя 2014
This platform provides you sequential study material of different classes with easiest way.
Greedy Algorithm ||Optimization Problem||
A greedy algorithm builds a solution by repeatedly choosing the locally optimal option with the hope of finding a global optimum. It's used when a problem can be broken down into stages where the best choice at each stage leads to the best overall solution.
#greedyalgorithm #algorithmvisualization#algorithmdesignmethods #algorithmtechniques #algorithm #ada #btech #algorithminsights #education #designandanalysisofalgorithms #algorithms #datastructuresandalgorithms #bca #complexity
#greedyalgorithm #algorithmvisualization#algorithmdesignmethods #algorithmtechniques #algorithm #ada #btech #algorithminsights #education #designandanalysisofalgorithms #algorithms #datastructuresandalgorithms #bca #complexity
Просмотров: 26
Видео
Merge Sort Pseudo Code
Просмотров 414 дня назад
Divide and conquer: ruclips.net/video/yw93tKPw944/видео.htmlsi=dTHo2FOK3rsqxbY Merge Sort concept: ruclips.net/video/YZMASj5iyLk/видео.htmlsi=T9i9_0uYuew-0ITF Merge sort is a divide-and-conquer algorithm that recursively splits the array into halves, sorts each half, and then merges the sorted halves back together. This process ensures a stable and efficient sorting with a time complexity of O(...
How to perform Merge Sort with example
Просмотров 184 дня назад
Divide and conquer: ruclips.net/video/yw93tKPw944/видео.htmlsi=dTHo2FOK3rsqxbY Merge Sort concept: ruclips.net/video/YZMASj5iyLk/видео.htmlsi=T9i9_0uYuew-0ITF Merge sort is a divide-and-conquer algorithm that recursively splits the array into halves, sorts each half, and then merges the sorted halves back together. This process ensures a stable and efficient sorting with a time complexity of O(...
Merge Sort || Introduction with characteristics
Просмотров 134 дня назад
Divide and conquer: ruclips.net/video/yw93tKPw944/видео.htmlsi=dTHo2FOK3rsqxbY Merge sort is a divide-and-conquer algorithm that recursively splits the array into halves, sorts each half, and then merges the sorted halves back together. This process ensures a stable and efficient sorting with a time complexity of O(n log n). #quicksort#mergesort #sortingtechniques #sortingalgorithm#algorithmvis...
Quick Sort Pseudo Code
Просмотров 294 дня назад
Divide and conquer: ruclips.net/video/yw93tKPw944/видео.htmlsi=dTHo2FOK3rsqxbYr Quicksort is a highly efficient sorting algorithm that uses a divide-and-conquer strategy to sort elements. It works by selecting a "pivot" element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then recursi...
Sorting Bulletin #sortingalgorithm #sortingtechniques
Просмотров 186 дней назад
Merge Sort #gaming #sortingalgorithm #mergesort
Просмотров 286 дней назад
How to Perform Quick Sort..? || Detailed explanation with example.
Просмотров 356 дней назад
Introduction of sorting: ruclips.net/video/nepch_hhedc/видео.htmlsi=Qmj1wt5_YTQRQSG4 Divide and conquer: ruclips.net/video/yw93tKPw944/видео.htmlsi=dTHo2FOK3rsqxbYr Quicksort is a highly efficient sorting algorithm that uses a divide-and-conquer strategy to sort elements. It works by selecting a "pivot" element from the array and partitioning the other elements into two sub-arrays according to ...
Quick Sort Algorithm visualisation #sortingalgorithm #quicksort
Просмотров 306 дней назад
Quick Sort Introduction #quicksort
Просмотров 807 дней назад
Introduction of sorting: ruclips.net/video/nepch_hhedc/видео.htmlsi=Qmj1wt5_YTQRQSG4 Divide and conquer: ruclips.net/video/yw93tKPw944/видео.htmlsi=dTHo2FOK3rsqxbYr Quicksort is a highly efficient sorting algorithm that uses a divide-and-conquer strategy to sort elements. It works by selecting a "pivot" element from the array and partitioning the other elements into two sub-arrays according to ...
Insertion Sort Pseudo Code || Part-l
Просмотров 6011 дней назад
This Video covers algorithms and behind logic of it part 1 of Insertion sort #algorithm #insertionsort
Insertion Sort Theory
Просмотров 10111 дней назад
This Video covers Theory or concept part of Insertion sort which core tried to make you understand through real life example here we tried to fix in our mind that sorting is nothing just a real life sorting element problem we just need to relate it and create certain logic that we call Algorithms... enjoy the journey and also support us by subscription it's actually takes effort. thank you : ) ...
Selection Sort Algorithm with example ||Complexity
Просмотров 8412 дней назад
Sorting:ruclips.net/video/nepch_hhedc/видео.htmlsi=asmX3WbCG9IN4UmB Selection Sort iteratively selects the smallest remaining unsorted element and swaps it with the first unsorted position. This process continues until the entire list is sorted. #selectionsort #selection #algorithm #ada #btech #algorithminsights #education #designandanalysisofalgorithms #algorithms #datastructuresandalgorithms ...
Bubble Sort Algorithm with Example
Просмотров 8813 дней назад
Sorting Introduction: ruclips.net/video/nepch_hhedc/видео.htmlsi=hWg8M_QdFpeAEuBg Complexity:ruclips.net/video/Re6Z-Pvmbbg/видео.htmlsi=0QBS_HXRjUPKYAXd Find Complexity: ruclips.net/video/MPzxZnOf94I/видео.htmlsi=dLPm_7z-DNdip5eS Bubble Sort repeatedly compares and swaps adjacent elements if they are in the wrong order, continuing this process until the list is sorted. This iterative process en...
Introduction to Sorting || Relation between multiple sorting algorithms|| Complexity
Просмотров 14013 дней назад
Divide and Conquer Algorithm: ruclips.net/video/yw93tKPw944/видео.htmlsi=qyE1qBZI17Z5Fhw5 Complexity:ruclips.net/video/Re6Z-Pvmbbg/видео.htmlsi=0QBS_HXRjUPKYAXd Find Complexity: ruclips.net/video/MPzxZnOf94I/видео.htmlsi=dLPm_7z-DNdip5eS Sorting algorithms are procedures used to reorder elements in a list according to a defined sequence, such as ascending or descending numerical value. They enh...
Nice explanation Ma'am 😃😇
Thank you so much 🙏🏻😊 trying to provide easier way of understanding
Source code bro ❤🎉
Great explanation of backtracking! Ma'am your teaching style makes complex topics much easier to grasp.
Thanks a ton 😊 actually it's my aim to serve complete syllabus of ADA (DAA) in very easier way.
Discuss traversive and top down strategy for problem solving ❤
Sure
This is what I search for whole RUclips ❤❤🎉
Glad to hear that 🙂 I am trying to provide easier plateform for all the methods of DAA.
@@learnwithprernajha7233 yes actually nobody teaches us how to design algorithm rather than just tell the solution and analyze it
At after 5:09 nailed it... Broke the Pattern
Hat's Off 🫡
Hello ma'am please 1 video create insertion sort per bana degea ga ma'am please humble request
Sure raunak request accepted 🙂 and I uploaded all the best👍
Thank you so much ma'am 😊
Best video for divide and conquer till now available on RUclips 🔥
Thanks a ton
Like the comment if you are also Preparing one night before the exam 😂
No one has explained like u till date ..The way u r explaining any new comer also could know easily ..Thanks a lot
Thank you so much 😀 glad to hear that 😊 I am trying to cover whole syllabus for algorithm design and analysis in sequential manner with easiest methods.
Everything is just cleared ❤
Thank you so much ma'am and I am easly understand this topic😊
Glad to hear that
O(logn)
D
Thanks mam
Most welcome 😊
Mam please make a video for knapsack problem
I am section b
Hell Yeah ❤❤❤❤
✨
amazing video mam also mam make a video on mathematical analysis of recursive and non recursive
Sure very soon
ma'am also create 0/1 Knapsack problem video.
Very soon
thank you so much ma'am🥰🥰
😇
Mughe feel nhi hua Mai paid course kr rha hu ya free because itna sara example k sath ek ek topic explanation mughe paid course m bhi nhi mila such a good Explanation Mam, waiting for next video 😊
Glad to hear that 😌 you like the video
Mai all sorting ki bhi video upload kijye na
Sure very soon 🙂
Very interesting this topic madam and for me time complexity methods like pow(),free()
Thanks for liking
Superb explanation
Glad you liked it❤️
really helpful video mam
Glad to hear that
Well focused on the right topic thanks mam and please provide the next topic lecture so it can help us.
Sure
Thank you so much ma'am and I am clearly understanding this topic .😊
Most welcome 😊
Very well done ma'am.. the way of your explanation is really amazing.. easy language and understanding.😊
Thanks a lot 😊
I really appreciate all of your hard work mam. This lecture is very helpful for me❤ You have explained very well than others, mam🙏🏻 Thank you mam ☺️. I understood very easily time complexity .
Thank you Roshan 😊 I am glad to hear that
Ma'am make next video on sub set sum problem in ada
Sure I will upload very soon
Wao most understable lecture mam
It's my pleasure
👍👍
Very nice teacher prerna Ma’am I suggest to all students please watch because it can be very helpful for you. so don’t miss it
Thanks a lot