https://github.com/jhsc/ruby-data-structures

Notes: Data structure review in Ruby.
https://github.com/jhsc/ruby-data-structures

Last synced: about 1 month ago
JSON representation

Notes: Data structure review in Ruby.

• Host: GitHub
• URL: https://github.com/jhsc/ruby-data-structures
• Owner: jhsc
• Created: 2015-01-03T22:04:36.000Z (almost 10 years ago)
• Default Branch: master
• Last Pushed: 2015-01-16T07:08:20.000Z (almost 10 years ago)
• Last Synced: 2024-04-16T12:10:17.540Z (8 months ago)
• Language: Java
• Size: 191 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
ruby-data-structures

====================

Notes: Data structure review in Ruby. 

**Overview about data structures and algorthms.

Linked lists, binary trees, tries, stacks, queues, dynamic arrays, hash tables/maps

Breadth first search, depth first search, binary search, merge sort, quick sort, tree insert/find/etc

Recursion

Big-O time on all of the above

How to identify choices that will result in big performance gains/losses (i.e. don't worry about minor gains/losses), especially if that choice would mean the difference between a feasible solution and an infeasible solution

OOP design principles

- Stacks & Queues

------

1. Allow only a single item to be added or removed at a time

2. Stacks allow access to the last item inserted (LIFO)

3. Queues allow access to the first item inserted (FIFO)