Understanding algorithms and data structures is fundamental to creating efficient software. In this course, Algorithms and Data Structures – Part 2, you’ll learn many algorithms and data structures used in software development. First, you’ll explore sorting and searching algorithms. Next, you’ll discover advanced data structures such as sets, heaps, balanced binary trees, B-Trees, and priority queues. Finally, you’ll learn how to safely use these algorithms and data structures in multi-threaded or concurrent programming environments. When you’re finished with this course, you’ll have the skills and knowledge of algorithms and data structures needed to successfully apply them in your own software development projects.
Author Name: Robert Horvick
Author Description:
Robert spent nearly 10 years at Microsoft creating software that made it easier for everyone else to write software. Most recently Robert worked on Team Foundation Server on the Administration and Version Control teams. Currently Robert can be found working in the utilities sector on Smart Grid technologies. Robert fled the Minnesota winters and currently lives near Raleigh, NC with his wife Susan and four children, Cecilia, Brian, Ben and Evelyn. When not tackling technical challenges … more

Table of Contents

• Course Overview
  1min
• Sorting and Searching Array Data
  29mins
• String Searching Algorithms
  20mins
• Balanced Binary Trees
  21mins
• Sets and Set Algorithms
  17mins
• B-Trees
  31mins
• Heaps and Priority Queues
  17mins
• Collection Concurrency
  29mins