{"id":27650469,"url":"https://github.com/kenken64/js_datastructure_algorithm","last_synced_at":"2026-06-23T22:03:07.274Z","repository":{"id":100861439,"uuid":"182974690","full_name":"kenken64/JS_dataStructure_algorithm","owner":"kenken64","description":"Javascript Data Strucure , Sorting and Searching Algorithm","archived":false,"fork":false,"pushed_at":"2019-04-23T11:48:13.000Z","size":4005,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-24T03:39:48.371Z","etag":null,"topics":["arrays","hashtables","javascript","linkedlist","nodejs"],"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/kenken64.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,"zenodo":null}},"created_at":"2019-04-23T08:54:18.000Z","updated_at":"2019-04-23T11:48:15.000Z","dependencies_parsed_at":"2023-06-02T05:30:25.751Z","dependency_job_id":null,"html_url":"https://github.com/kenken64/JS_dataStructure_algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/kenken64/JS_dataStructure_algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenken64%2FJS_dataStructure_algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenken64%2FJS_dataStructure_algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenken64%2FJS_dataStructure_algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenken64%2FJS_dataStructure_algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kenken64","download_url":"https://codeload.github.com/kenken64/JS_dataStructure_algorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kenken64%2FJS_dataStructure_algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271478009,"owners_count":24766424,"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","status":"online","status_checked_at":"2025-08-21T02:00:08.990Z","response_time":74,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["arrays","hashtables","javascript","linkedlist","nodejs"],"created_at":"2025-04-24T03:39:47.062Z","updated_at":"2026-06-23T22:03:02.253Z","avatar_url":"https://github.com/kenken64.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"## What Big O notation?\n\nBig O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. It is a member of a family of notations invented by Paul Bachmann, Edmund Landau, and others, collectively called Bachmann–Landau notation or asymptotic notation.\n\n\u003cimg src=\"https://i.stack.imgur.com/WcBRI.png\"/\u003e\n\n\u003cimg src=\"https://github.com/trekhleb/javascript-algorithms/raw/master/assets/big-o-graph.png\"/\u003e\n\nhttp://bigocheatsheet.com/\n\n# Data Structure\n\n## Linked List\n\nA linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers as shown in the below image:\n\n\u003cimg src=\"./images/linkedlist.gif\"/\u003e\n\n## Double Linked List\n\nA Doubly Linked List (DLL) contains an extra pointer, typically called previous pointer, together with next pointer and data which are there in singly linked list.\n\n## Arrays\n\nAn array can be defined as an ordered collection of items indexed by contiguous integers.\n\n\u003cimg src=\"./images/arrays.gif\"/\u003e\n\n## Stacks\n\nStack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).\n\n## Queues\n\nA Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.\n\n## Hash Tables\n\nHash Table is a data structure which stores data in an associative manner. In a hash table, data is stored in an array format, where each data value has its own unique index value. ... Thus, it becomes a data structure in which insertion and search operations are very fast irrespective of the size of the data.\n\n## Heaps\n\n## Binary Search Trees\n\n## Bloom Filter\n\n# List Search\n\n## linear Search\n\n## Binary Search\n\n# Graph Search\n\n## Breath-First-Search\n\n## Depth-First-Search\n\n# Data Compression\n\n## Run-Length Encoding\n\n## Huffman Coding\n\n# Math\n\n## Euclidian Algorithm\n\n## Primality Test\n\n# Security\n\n## Encryption Basics\n\n## Hash functions\n\n# Sorting\n\n## Bubble Sort\n\n\"Bubble sort\" is one algorithm used to sort a sequence of numbers\n\nThe scales at the right end of the sequence will compare the numbers on their left and right sides\n\n## Selection Sort\n\n## Insertion Sort\n\n## Heap Sort\n\n## Merge Sort\n\n## Quicksort\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkenken64%2Fjs_datastructure_algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkenken64%2Fjs_datastructure_algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkenken64%2Fjs_datastructure_algorithm/lists"}