![Saranya Suresh](/img/default-banner.jpg)
- 80
- 649 922
Saranya Suresh
India
เข้าร่วมเมื่อ 27 พ.ค. 2018
Check out my full courses on Udemy:
Course 1: Data Structures and Algorithms-Deep Dive into Core Concepts
www.udemy.com/course/data-structures-and-algorithms-deep-dive-into-core-concepts/?referralCode=E66A4A00B5A340444167
Course 2: Deep Dive into Algorithm Design Paradigms
www.udemy.com/course/sorting-algorithms-data-structures/?referralCode=C24FFF7998A56BAEB25D
Happy Learning!
Course 1: Data Structures and Algorithms-Deep Dive into Core Concepts
www.udemy.com/course/data-structures-and-algorithms-deep-dive-into-core-concepts/?referralCode=E66A4A00B5A340444167
Course 2: Deep Dive into Algorithm Design Paradigms
www.udemy.com/course/sorting-algorithms-data-structures/?referralCode=C24FFF7998A56BAEB25D
Happy Learning!
Stack Implementation Using L L - Advantages, Disadvantages and Applications
Stack Implementation Using L L - Advantages, Disadvantages and Applications
มุมมอง: 2
วีดีโอ
Stack Implementation Using Linked Lists
มุมมอง 712 ชั่วโมงที่ผ่านมา
Stack Implementation Using Linked Lists
Stack Implementation Using Array - Advantages, Disadvantages and Applications
มุมมอง 112 ชั่วโมงที่ผ่านมา
Stack Implementation Using Array - Advantages, Disadvantages and Applications
Deleting an Element from the Priority Queue
มุมมอง 212 ชั่วโมงที่ผ่านมา
Deleting an Element from the Priority Queue
Inserting an Element into the Priority Queue
มุมมอง 212 ชั่วโมงที่ผ่านมา
Inserting an Element into the Priority Queue
DEQUE (Double-Ended Queue) - Insertion Operation
มุมมอง 712 ชั่วโมงที่ผ่านมา
DEQUE (Double-Ended Queue) - Insertion Operation
Circular Queue - Dequeue / Deletion Operation
มุมมอง 112 ชั่วโมงที่ผ่านมา
Circular Queue - Deletion Operation
Circular Queue - Enqueue / Insertion Operation
มุมมอง 512 ชั่วโมงที่ผ่านมา
Circular Queue - Insertion Operation
Queue Implementation Using Linked List
มุมมอง 1712 ชั่วโมงที่ผ่านมา
Queue Implementation Using Linked List
Hiring Problem Using Randomized Algorithm
มุมมอง 3521 วันที่ผ่านมา
Hiring Problem - Deterministic and Randomized Algorithm
Maximum Subarray Sum using Kadane's Algorithm
มุมมอง 721 วันที่ผ่านมา
Maximum Subarray Sum using Kadane's Algorithm
Maximum Subarray Sum using Divide and Conquer Method
มุมมอง 921 วันที่ผ่านมา
Maximum Subarray Sum using Divide and Conquer Method
Strassen’s Matrix Multiplication - Divide and Conquer Method
มุมมอง 6021 วันที่ผ่านมา
Strassen’s Matrix Multiplication - Divide and Conquer Method
Solving Recurrence Relations Using Substitution method 2
มุมมอง 11หลายเดือนก่อน
Solving Recurrence Relations Using Substitution method 2
Solving Recurrence Relations Using Substitution method1
มุมมอง 52หลายเดือนก่อน
Solving Recurrence Relations Using Substitution method1
Bubble Sort Algorithm - Example, Pseudocode and Time Complexity Analysis
มุมมอง 17หลายเดือนก่อน
Bubble Sort Algorithm - Example, Pseudocode and Time Complexity Analysis
Quick Sort Algorithm - Pseudocode and Time Complexity Analysis
มุมมอง 27หลายเดือนก่อน
Quick Sort Algorithm - Pseudocode and Time Complexity Analysis
Merge Sort Algorithm - Pseudocode and Time Complexity Analysis
มุมมอง 32หลายเดือนก่อน
Merge Sort Algorithm - Pseudocode and Time Complexity Analysis
Insertion Sort Algorithm - Pseudocode and Time Complexity Analysis
มุมมอง 15หลายเดือนก่อน
Insertion Sort Algorithm - Pseudocode and Time Complexity Analysis
Thank you miss❤❤❤
❤
I don't know this language 🤡😢
a=[5,7,9,13,32,33,42,54,56,88] z=88 low=0 high=len(a)-1 while low<=high: m = (low+high)//2 if a[m]==z: print("Found",a[m],"at position",m) break elif a[m]<z: low=m + 1 elif a[m]>z: high=m - 1 if low>high: print("Not Found") print("Crafted by: Subham Roy")
Mam we have to append with sign bit or 0??
Thank you so much maam
Tanks🙏
could have been better if it was little louder
thank you ma'am
understanding 💯
❤nice
maam apka to faan ho gaya
Excellent video ❤
Iske marks nhi milange.. 😝
finally found a good lecture aftere a long search... good one
Thank you soo much ma'am..
After watching so many videos of merge sort i understood this video thanks 😁
❤ 0:12
Thank You Soo Much Ma'am
Thank You Soo Much Ma'am
*GAANDFAAD* EXPLANATION MAM! THANK YOU SO MUCH MADAM !!
Pura confusion ki dukan khol di h
How did u get the last answer u haven't explained it
Im not getting the verification ans for 2nd question
To cross verify the answer 297 answer should be represented in how many bits
How to add all for final answer?
Actually not any of my teachers explained this algorithm this much beautifully. Thank you soo much maam. Keep posting videos like this. 🎉❤
really i understand very well thank you mam🤝
At the last step after multiplication how you add you didn't explain. Pls explain
How to multiply -2
Excellent explanation 🎉❤ thank you mam🎉❤
Thanks mam.. Hope you make more videos
u cleared all my problems, where many failed to do. thank u 😇😇😇
☺
it is too useful for me because tomorrow is my exam 🥲🥲🥲🥲
Thanku mam I understand bit pair algorithm for you❤❤❤
Ma'am at 10:38 you made a mistake at left shifting it's actually 001[] . Thanks for clarifying me the topic
good!
thank you amazing explanation
tmro is my exam i am watching this video today || thanks for this nice explanation mam.😀
Hi Iam roll number 94 from I1 Section. I have a youtube channal named Dept of CSE. If u r ok we can colaborate and make asome study videos. Looking forward to hear frm u!!!!!!!!! I will meet u in campus regarding THis!!!!!!!
Konchem slow gà cheppandi akka....Maree intha fast aa...😢2x lo chusinattundhi...🤷♂️kaani chala...Baga ❤️😋explain chesaaru...thank you So...much🌹thank uuu...madam....❤
What the difference between NRA AND Rd
Mam you did small mistake in last step
what if we have to add 1+1+1+1. How to write it ?
Great Explanation 😍
Do encourage her bro
Is this recursive one
Mind blowing explanation 😘
Very nicely explained mam TQ.....pls pls upload the videos of daa