DAA58: Finding Maximum and Minimum using Divide and Conquer in daa
HTML-код
- Опубликовано: 21 окт 2024
- Download Notes from the Website:
www.university...
Or universityacad...
Download DAA Hand Written Notes: imojo.in/335py6y
Join our official Telegram Channel by the Following Link:
t.me/universit...
Join WhatsApp Group by Link: chat.whatsapp....
Topics: Design and Analysis of Algorithm, Advanced Data Structures, Divide and Conquer, Greedy Methods, Dynamic Programming, Backtracking, Branch and Bound, Selected Topics.
Faculty: Sandeep Vishwakarma
University Academy is India’s first and largest platform for professional students of various streams that were started in 2017. University Academy comprises of a committed band of highly experienced faculties from various top universities or colleges of India.
……………………………………………………………………………………………………………………………………………………………
#DAA #SandeepSir #OnlineCourses #AcademicSubject
……………………………………………………………………………………………………………………………………………………………
Complete Playlist :
1. • Programming For Proble...
2. • C Programming For Begi...
3. • Basic Electrical Engin...
4. • Fundamentals of Electr...
5. • PPS Lab(KCS151P / KCS2...
6. • Engineering Physics
7. • Fundamentals of Mechan...
8. • Artificial Intelligenc...
9. • Emerging Domain in Ele...
10. • Data Structure Lecture...
11. • Theory of Automata and...
12. • Operating System Tutor...
12. • Python Programming A P...
14. • Software Engineering
15. • Computer Organization ...
16. • Discrete Structures an...
17. • Design and Analysis of...
18 • Compiler Design Tutori...
19. • Principle of Programmi...
20. • Web Technology In Hindi
21. • Data Warehousing and D...
22. • Database Management Sy...
23. • Cyber Security Tutoria...
24. • Computer Network Tutor...
25. • Distributed System Tut...
26. • Cloud Computing Tutorial
27. • Manufacturing Processes
28. • Network Analysis & Syn...
29. • Class 10 Maths(NCERT |...
30. • Control System Lectures
31. • Microprocessor Lecture...
32. • Digital System Design ...
33. • Signals & Systems Lect...
34. • Transportation Enginee...
36. • Android Studio 3.0 (Mo...
36. • C Programming : Practi...
37. • JavaScript in Hindi
38. • Java Programming in Hindi
39. • JFLAP/TAFL Lab(Theory ...
40. • Tech News
41. Other: • Other
-------------------------------------------------------------------------------------------------------------
Regards
University Academy
WhatsApp: +91-9311825328
Email: info@universityacademy.in
Website:
www.university...
www.university...
bohot badiya se explain kiye hain sir aap
Great.. It helps me a lot.. Thank you sir
sort it ,then first element a[0] is min, a[last] is max but inO(nlogn)
Excellent work
Super sir clearly it's understand.
VERY NICE VIDEO. SUPERB SIR
thank you
sir master method ka 2nd case nhi lagega ? f(n) = log a base b
sir if we use iteration method then also we can do this in O(n), so what is the benefit of using divide and conquer algorithm here?
now as we know that time complexity is same in both cases , so the difference is number of comparisons. in divide and conquer method ,no. of comparisons are far less as in the case of iterative method! hope this helps
Sir logic smjh ja rha hu bt. Pseudo code glt lg rha na koi array, min1,max1 ka comparison hai hi ni kahi pe jo function return kr rha... Inshort code pe thoda dhyan dijiye sir
Sir y topic abhi tk clear hi ni ho rha tha Pr jbse apki video dekha hu tbse to algorithm bhi m khud se likh skta hu
Sir Best case time complexity for min and max of array
sir what arguments do we pass in min&max while calling the function for first time?
thank you
initialize the min variable by INFINITY and the max element by -INFINITY
max1, min1 are not defined
ye start array 1 se kaise hoga starting to 0(zero) to 8(Eight ) hona chahiyenah
In algorithm designing you can write it.
@@UniversityAcademy thanks sir
🔥
wow
first