{"id":22240160,"url":"https://github.com/mharikmert/text-representation-with-bst","last_synced_at":"2025-03-25T10:21:58.127Z","repository":{"id":122958501,"uuid":"348001245","full_name":"mharikmert/text-representation-with-bst","owner":"mharikmert","description":"A simple word sorting algorithm with different Binary Search Trees and time complexities in C programming language ","archived":false,"fork":false,"pushed_at":"2021-03-15T17:03:49.000Z","size":13,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-30T09:29:06.262Z","etag":null,"topics":["algorithm","binary-search-tree","c","time-complexity","time-complexity-analysis"],"latest_commit_sha":null,"homepage":"","language":"C","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/mharikmert.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":"2021-03-15T14:27:06.000Z","updated_at":"2023-03-05T06:47:05.000Z","dependencies_parsed_at":"2024-06-09T00:00:45.752Z","dependency_job_id":null,"html_url":"https://github.com/mharikmert/text-representation-with-bst","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/mharikmert%2Ftext-representation-with-bst","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mharikmert%2Ftext-representation-with-bst/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mharikmert%2Ftext-representation-with-bst/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mharikmert%2Ftext-representation-with-bst/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mharikmert","download_url":"https://codeload.github.com/mharikmert/text-representation-with-bst/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245440654,"owners_count":20615666,"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":["algorithm","binary-search-tree","c","time-complexity","time-complexity-analysis"],"created_at":"2024-12-03T03:29:02.410Z","updated_at":"2025-03-25T10:21:58.090Z","avatar_url":"https://github.com/mharikmert.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Text Representation with Binary Search Trees\n## How it works?\nIt reads __number__, __word__, __frequency__ structured input files in files folder. \u003cbr\u003e\nFirstly words are compared and be sorted in alphabetical order in a binary search tree. \u003cbr\u003e\nThen frequencies are compared and words exchanes in the binary search tree according to their frequencies.\u003cbr\u003e\nAfter the binary tree is created, total access time of the BST is also calculated. \u003cbr\u003e\nIdea behind creating two BTS is to see the change of the total access time between two different BTS\n\n## Sample Inputs \n| Number| Word          | Frequency |\n| ----- |:-------------:| ----------:|\n| 1     | people     |6|\n|2| country|10|\n| 3     | city |15|\n| 4     | news    |2|\n| 5     | population   |1|\n| 6     | society    |28|\n| 7     | university    |35|\n| 8     | sports    |62|\n|9|basketball|28\n## Outputs \n#### First Binary Search Tree\n![Screenshot from 2021-03-15 19-42-22](https://user-images.githubusercontent.com/42295478/111189086-c92b2980-85c6-11eb-8b32-7722fa42d945.png)\n\n#### Second Binary Search Tree \n![Screenshot from 2021-03-15 19-42-34](https://user-images.githubusercontent.com/42295478/111189123-d2b49180-85c6-11eb-8f65-319ef4654fc8.png)\n\n\n## Clone, Compile and Run\n\n```\n-\u003e git clone https://github.com/mharikmert/Text-Representation-with-BTS\n-\u003e gcc -o main main.c -lm\n-\u003e ./main\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmharikmert%2Ftext-representation-with-bst","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmharikmert%2Ftext-representation-with-bst","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmharikmert%2Ftext-representation-with-bst/lists"}