brendanpettis / algorithm-fundamentals Goto Github PK

can show the list going forward and then back

This would demonstrate an inefficient algorithm.

A demonstration of the binary search using a series of values in an array. Each comparison will be visualized and tallied. For example, an arrow could be above the value currently being checked and once the searched value is found, a tally of the total comparisons will be displayed.

A simple merge sort would be beneficial to the project.

Doing counting sort.

Here are some ideas for the color theme for the project. Will probably need a few of these to use with our different algorithm pages.
Theme1:
https://coolors.co/export/pdf/95c623-160c28-efcb68-e1efe6-002400
Theme2:
https://coolors.co/export/pdf/4b3b40-d9e5d6-eddea4-82735c-9db17c
Theme3:
https://coolors.co/export/pdf/e6eed6-d6f599-889696-090c02-420217
Theme4:
https://coolors.co/export/pdf/0d1321-3c91e6-c6c013-ff6978-eef0f2
Theme5:
https://coolors.co/export/pdf/3a3042-db9d47-89b6a5-c9eddc-82968c

Please comment and which ones you like best, it is also very easy to get more ideas from https://coolors.co/ for more options.

Requesting to do a Binary Tree to go alongside the Binary Search Tree.

I am requesting to complete a queue.

A basic bubble sort implementation would be cool!

A simple stack data structure would be nice. JS already has a bunch of stack functionality built into its Array object that I can use to get it up and running quickly.

Requesting to do a BST

I think this is super 🆒 !

Seeing a singly linked list would be neat.