{"id":17770647,"url":"https://github.com/yazaldefilimone/algorithms-backup","last_synced_at":"2025-10-16T21:24:17.015Z","repository":{"id":158955476,"uuid":"479124532","full_name":"yazaldefilimone/algorithms-backup","owner":"yazaldefilimone","description":"🤓 | Computer science | Algorithms | Data structures","archived":false,"fork":false,"pushed_at":"2024-01-06T22:31:10.000Z","size":508,"stargazers_count":7,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-06T17:22:52.258Z","etag":null,"topics":["algorithms","computer-science","data-structures"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/yazaldefilimone.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-04-07T19:37:56.000Z","updated_at":"2024-09-30T12:19:39.000Z","dependencies_parsed_at":"2024-01-06T23:57:14.330Z","dependency_job_id":null,"html_url":"https://github.com/yazaldefilimone/algorithms-backup","commit_stats":{"total_commits":645,"total_committers":1,"mean_commits":645.0,"dds":0.0,"last_synced_commit":"c6c7a28149c0eecffaa5dbb411a424d5e9aa5e8b"},"previous_names":["yazaldefilimone/algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yazaldefilimone%2Falgorithms-backup","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yazaldefilimone%2Falgorithms-backup/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yazaldefilimone%2Falgorithms-backup/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yazaldefilimone%2Falgorithms-backup/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yazaldefilimone","download_url":"https://codeload.github.com/yazaldefilimone/algorithms-backup/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243742775,"owners_count":20340700,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","computer-science","data-structures"],"created_at":"2024-10-26T21:24:28.325Z","updated_at":"2025-10-16T21:24:11.948Z","avatar_url":"https://github.com/yazaldefilimone.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003csamp\u003e\n\n**NB:** All data structures implement from scratch without using an existing structure, and I intend to reuse them in the algorithms\n\n- You can see my past [Problem Solver](/2023_09_algorithms)\n\n### Technical\n\n- [x] Big O notation\n  - [x] Constant - (1)\n  - [x] Linear - (n)\n  - [x] Logarithmic - (log n)\n  - [x] Quadratic (n^2)\n  - [x] Exponential (2^n)\n\n### Data Structures\n\n- [x] [Array](/computer_science/data-structure/arrays/array.js)\n- [x] [Graphs](/computer_science/data-structure/graphs/graph.js)\n- [x] [Linked List](/computer_science/data-structure/linked-list/linked-list.js)\n- [x] [Doubly Linked List](/computer_science/data-structure/linked-list/doubly-linked-list.js)\n- [x] [Queue](/computer_science/data-structure/queue/queue.js)\n- [x] [Stack](/computer_science/data-structure/stack/stack.js)\n- [x] [Hash Table](/computer_science/data-structure/hash-table/hash-table.js)\n- [x] [Tree](/computer_science/data-structure/tree/tree.js)\n- [x] [Binary Search Tree](/computer_science/data-structure/tree/binary-search-tree.js)\n- [x] [Graph](/computer_science/data-structure/graphs/graph.js)\n- [x] [Min Heap](/computer_science/data-structure/heap/min-heap.js)\n- [ ] Max Heap\n- [ ] Priority Queue\n- [ ] AVL Tree\n- [ ] Red-Black Tree\n- [ ] Segment Tree\n- [ ] Fenwick Tree\n- [ ] Disjoint Set\n- [ ] Bloom Filter\n- [ ] LRU Cache - Least Recently Used (LRU) cache\n\n### Algorithms\n\n- Sorting:\n\n- [x] [Bubble Sort](/computer_science/algorithms/bubble-sort/bubble-sort.js)\n- [x] [Selection Sort](/computer_science/algorithms/selection-sort/selection-sort.js)\n- [x] [Insertion Sort](/computer_science/algorithms/insertion-sort/insertion-sort.js)\n- [x] [Merge Sort](/computer_science/algorithms/merge-sort/merge-sort.js)\n- [x] [Quick Sort](/computer_science/algorithms/quick-sort/quick-sort.js)\n- [ ] Radix Sort\n- [ ] Bucket Sort\n- [ ] Heap Sort\n- [ ] Shell Sort\n- [ ] Counting Sort\n\n- Trees/Graphs:\n\n- [x] [Depth-First Search (DFS)](/computer_science/algorithms/graphs/depth-first-search/depth-first-search.js)\n- [x] [Breadth-First Search (BFS)](/computer_science/algorithms/graphs/breadth-first-search/breadth-first-search.js)\n- [ ] Kruskal’s Algorithm\n- [ ] Dijkstra Algorithm\n- [ ] Bellman-Ford Algorithm\n- [ ] Floyd-Warshall Algorithm\n- [ ] Detect Cycle\n- [ ] Prim’s Algorithm\n- [ ] Topological Sorting\n- [ ] Articulation Points\n- [ ] Bridges\n- [ ] Eulerian Path and Eulerian Circuit\n- [ ] Hamiltonian Cycle\n- [ ] Strongly Connected Components\n- [ ] Travelling Salesman Problem\n\n### Math\n\n- [ ] Bit Manipulation - set/get/update/clear bits, multiplication/division by two, make negative etc.\n- [ ] Binary Floating Point - binary representation of the floating-point numbers.\n- [ ] Factorial\n- [ ] Fibonacci Number - classic and closed-form versions\n- [ ] Prime Factors - finding prime factors and counting them using Hardy-Ramanujan's theorem\n- [ ] Primality Test (trial division method)\n- [ ] Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)\n- [ ] Least Common Multiple (LCM)\n- [ ] Sieve of Eratosthenes - finding all prime numbers up to any given limit\n- [ ] Is Power of Two - check if the number is power of two (naive and bitwise algorithms)\n- [ ] Pascal's Triangle\n- [ ] Complex Number - complex numbers and basic operations with them\n- [ ] Radian \u0026 Degree - radians to degree and backwards conversion\n- [ ] Fast Powering\n- [ ] Horner's method - polynomial evaluation\n- [ ] Matrices - matrices and basic matrix operations (multiplication, transposition, etc.)\n- [ ] Euclidean Distance - distance between two points/vectors/matrices\n- [ ] Integer Partition\n- [ ] Square Root - Newton's method\n- [ ] Liu Hui π Algorithm - approximate π calculations based on N-gons\n- [ ] Discrete Fourier Transform - decompose a function of time (a signal) into the frequencies that make it up\n\n### Cryptography\n\n- [ ] Polynomial Hash - rolling hash function based on polynomial\n- [ ] Rail Fence Cipher - a transposition cipher algorithm for encoding messages\n- [ ] Caesar Cipher - simple substitution cipher\n- [ ] Hill Cipher - substitution cipher based on linear algebra\n\n### Machine Learning\n\n- [ ] NanoNeuron\n- [ ] k-NN\n- [ ] k-Means\n\n### Image Processing\n\n- [ ] Seam Carving\n- [ ] Weighted Random\n\n### License\n\n[MIT](https://github.com/yazaldefilimonepinto/algorithms/blob/main/LICENSE) © [Yazalde Filimone](https://www.linkedin.com/in/yazalde-filimone/)\n\n\u003c/samp\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyazaldefilimone%2Falgorithms-backup","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyazaldefilimone%2Falgorithms-backup","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyazaldefilimone%2Falgorithms-backup/lists"}