{"id":18369006,"url":"https://github.com/claudio-code/data-structure-algorithm-and-neural-network","last_synced_at":"2025-04-10T19:39:41.844Z","repository":{"id":38040466,"uuid":"412979070","full_name":"Claudio-code/data-structure-algorithm-and-neural-network","owner":"Claudio-code","description":":scroll:  I' m learning new algorithms and how create small and basic neural network","archived":false,"fork":false,"pushed_at":"2024-10-14T01:56:58.000Z","size":185,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-15T20:54:18.832Z","etag":null,"topics":["algorithms","big-o","data-structures","neural-network"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Claudio-code.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2021-10-03T04:53:52.000Z","updated_at":"2024-10-14T01:57:01.000Z","dependencies_parsed_at":"2024-12-24T01:41:35.927Z","dependency_job_id":"02f4c913-611e-416d-ad01-d489fb969896","html_url":"https://github.com/Claudio-code/data-structure-algorithm-and-neural-network","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Claudio-code%2Fdata-structure-algorithm-and-neural-network","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Claudio-code%2Fdata-structure-algorithm-and-neural-network/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Claudio-code%2Fdata-structure-algorithm-and-neural-network/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Claudio-code%2Fdata-structure-algorithm-and-neural-network/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Claudio-code","download_url":"https://codeload.github.com/Claudio-code/data-structure-algorithm-and-neural-network/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248281423,"owners_count":21077423,"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","big-o","data-structures","neural-network"],"created_at":"2024-11-05T23:28:07.913Z","updated_at":"2025-04-10T19:39:41.817Z","avatar_url":"https://github.com/Claudio-code.png","language":"Java","readme":"\u003ch3 align=\"center\"\u003e\n  :blue_heart: Data struture, algorithm :blue_heart:\n\u003c/h3\u003e\n\n\u003chr\u003e\n\n# Asymptotic analysis\n\n- The analysis small values has ignored and focus in big values of **n**.\n  - f(n) = n + 10\n- Small values of **n**, any algorithm cost little to be executed, even the inefficient algorithms.\n- Mathematically speaking, the asymptotic analysis is method to describe behavior of the limits.\n- It is desirable to express time consumption of algorithm without depending on language.\n- Example, in sequential search, the number of times the query key is compared with the key of each record.\n  - Worst case: f(n) = n\n  - Mid case: f(n) = (n + 1) / 2\n  - Best case: f(n) = 1\n- The best case matches with small-time of execution about all possibles size inputs of **n**.\n- The worst case matches with big time of execution about all possibles size inputs of **n**.\n- The mid-case matches with average time of execution about all possibles size inputs of **n**.\n  - It is one distribution of probabilistic about size of set **n**.\n\n\u003chr\u003e\n\n- [Stack](#stack)\n- [Queue](#queue)\n- [Deck](#deck)\n- [Linked List](#linked-list)\n- [Binary Tree](#binary-tree)\n- [Priority Queue](#priority-queue)\n- [Binary Heap](#binary-heap)\n- [Hash table](#hash-table)\n- [Dictionary](#dictionary)\n- [Fork](#fork)\n\n\u003chr\u003e\n\n\u003ca id=\"stack\"\u003e\u003c/a\u003e\n## Stack\n\n- They are data structure LIFO type `Last-In-First-Out`, where the last element to be inserted will be the first to be retired. So a stack allows access to one item of data the last inserted. \n\n\u003chr\u003e\n\n\u003ca id=\"queue\"\u003e\u003c/a\u003e\n## Queue\n\n- Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is open at its ends. One end is always used to insert data (enqueue) and the is used to remove data (dequeue). Queue follows `First-In-First-Out` methodology. \n\n\u003chr\u003e\n\n\u003ca id=\"deck\"\u003e\u003c/a\u003e\n## Deck\n\n- Deck is an irregular acronym of double-ended queue. Double-ended queues are sequence containers with dynamic sizes that can be expanded or contrasted on both ends.\n\n\u003chr\u003e\n\n\u003ca id=\"linked-list\"\u003e\u003c/a\u003e\n## Linked List\n\n- A linked list or a current list is a dynamic, linear data structure. It is composed of several cells that are interconnected through pointers, that is, each cell has a pointer that points to the memory address of the next cell.\n\n\u003chr\u003e\n\n\u003ca id=\"binary-tree\"\u003e\u003c/a\u003e\n## Binary tree\n\n- Is a data structure by: Or has no element. Or it has a distinct element, called the root, with two pointers to two different structures, called the left subtree and right subtree.\n\n\u003chr\u003e\n\n\u003ca id=\"priority-queue\"\u003e\u003c/a\u003e\n## Priority queue\n\n- It is a queue where each element has a priority. This priority determines the position of an element in the queue, so it determines who should be removed from the queue first.\n\n\u003chr\u003e\n\n\u003ca id=\"binary-heap\"\u003e\u003c/a\u003e\n## Binary Heap\n\n- The binary Heap is binary three complete or almost.\n- Have a Min-heap e Max-heap.\n  - Min-heap:\n    - The value of each node is greater than or equal to its parent's value, the lowest value is in the root.\n  - Max-heap:\n    - The value of each node is lowest than or equal to its parent's value, the greater value is in the root.\n  - The elements are arranged in heap so that the father always has greater or equal priority than their children's priority.\n\n\n\u003chr\u003e\n\n\u003ca id=\"hash-table\"\u003e\u003c/a\u003e\n## Hash table\n\n- Hash table is a data structure that associates lookup keys with values.\n- It is also called a scatter or disclosure table.\n- Purpose: do a quick search and get the desired value.\n\n\u003chr\u003e\n\n\u003ca id=\"dictionary\"\u003e\u003c/a\u003e\n## Dictionary\n\n- It is example of Hash table.\n- Hash table is representation of associates arrays.\n- each value have key associate.\n- utilize one function hash to compute one index in slots of arrays.\n\n\u003chr\u003e\n\n\u003ca id=\"fork\"\u003e\u003c/a\u003e\n## Fork\n\n- Fork is entity composted two parts:\n  - vertices (nodes)\n  - edges (rows)\n- The nodes are the little balls (entities you want to model).\n- Edges are the the relations of theses entities.\n\n### Adjacency Matrix\n\n- The first form represent one fork called adjacency Matrix.\n- It is math structure organized in table form with lines and column.\n- Adjacency: close, proximity.\n\n\u003cbr\u003e\n\n#### Example\n\u003cbr\u003e\n\n\u003cimg align=\"center\" width=\"50%\" height=\"50%\" src=\"images/Adjacency_Matrix.png\"\u003e\n\n\u003cbr\u003e\n\n- The row ***A*** and column ***E*** has filled with 0 indicating that there is not connection between ***A*** and ***E***.\n- The row ***C*** and column ***A*** has filled with 1 indicating that there is connection between ***C*** and ***A***.","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fclaudio-code%2Fdata-structure-algorithm-and-neural-network","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fclaudio-code%2Fdata-structure-algorithm-and-neural-network","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fclaudio-code%2Fdata-structure-algorithm-and-neural-network/lists"}