can someone please explain the below topics in detail. Maybe with examples, or c

Question

can someone please explain the below topics in detail. Maybe with examples, or comparisons- and if possible some good videos that details these specific options; although Im not looking for a handful of youtube links- some in addtion to expanation would be nice anything that would help- even pictures :)

Data Abstraction, Objects, References (1.2)

Bags, Queues and Stacks: Linked Structures (1.3)

More Linked Structures (1.3)

Analysis of Algorithms (1.4)

Union-Find (1.5)

Elementary Sorts, Comparators (2.1)

Priority Queues (2.4)

Mergesort, Quicksort (2.2, 2,3)

these sections come from the algorithms 4th edition book

Explanation / Answer

Just visit this link:

http://nptel.ac.in/video.php?subjectId=106102064

Order of growth:

Order of growth tell us about how much "faster" the algorithm is running on computer and how much "time" does it take to solve problem

Example:

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.