Skip to content
TrackPodcasts
artsFeb 24, 202653:37pending

Ruby Data Structures and Algorithms

About this episode

A comprehensive textbook or guide focusing on the implementation and analysis of fundamental data structures and algorithms using the Ruby programming language. It covers various core concepts, starting with abstract data types (ADTs), their implementation as data types in Ruby, and the importance of assertions for program correctness. The text details common data structures like queues, stacks, lists, binary trees (including AVL and 2-3 trees), sets, and maps, discussing both contiguous and linked implementations for many of them. Furthermore, it introduces algorithm analysis, including computational complexity (best, worst, and average case) and function growth rates, and explores various sorting algorithms (e.g., merge sort, quicksort), along with graph representations and search algorithms (depth-first and breadth-first search).

You can listen and download our episodes for free on more than 10 different platforms:
https://linktr.ee/cyber_security_summary

Discover our free courses in tech and cybersecurity, Start learning today:
https://linktr.ee/cybercode_academy

Get every episode summarized

Each time CyberSecurity Summary publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.

Email me new episodes

Free for 3 shows. No card needed.

Hosts & guests

No transcript yet

This episode has not been transcribed. Request it and it moves to the front of the queue.

Ruby Data Structures and Algorithms

CyberSecurity Summary

0:00
53:37

More episodes

More from CyberSecurity Summary

View all episodes →