{"id":19937150,"url":"https://github.com/my-python-projects/ordination-work","last_synced_at":"2025-10-28T17:44:32.036Z","repository":{"id":221551856,"uuid":"276506773","full_name":"my-python-projects/Ordination-Work","owner":"my-python-projects","description":"(PT-BR) Trabalho Prático Final da disciplina Análise de Algoritmo, UNIBH, 7 periodo.  (ENG) Final Practical Work on the subject Algorithm Analysis, UNIBH, 7th period.","archived":false,"fork":false,"pushed_at":"2020-07-04T00:16:36.000Z","size":58,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-12T03:02:11.232Z","etag":null,"topics":["bubblesort","insert","jprogram","ordenation","ordination","python","python3","quicksort","sort","tkinter","unibh"],"latest_commit_sha":null,"homepage":"","language":"Python","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/my-python-projects.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}},"created_at":"2020-07-01T23:57:27.000Z","updated_at":"2024-02-13T01:06:26.000Z","dependencies_parsed_at":"2024-02-08T17:43:37.987Z","dependency_job_id":null,"html_url":"https://github.com/my-python-projects/Ordination-Work","commit_stats":null,"previous_names":["my-python-projects/ordination-work"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/my-python-projects%2FOrdination-Work","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/my-python-projects%2FOrdination-Work/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/my-python-projects%2FOrdination-Work/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/my-python-projects%2FOrdination-Work/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/my-python-projects","download_url":"https://codeload.github.com/my-python-projects/Ordination-Work/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241365174,"owners_count":19951113,"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":["bubblesort","insert","jprogram","ordenation","ordination","python","python3","quicksort","sort","tkinter","unibh"],"created_at":"2024-11-12T23:31:12.579Z","updated_at":"2025-10-28T17:44:31.955Z","avatar_url":"https://github.com/my-python-projects.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Ordination-Work\n\n### --\u003e Execution of the work:\n\n![](img/tabela_ordenacoes.PNG)\n\n\n\n\n__(PT-BR) {__\n    \n    descricao = \"\n        \n        Trabalho Prático Final da disciplina Análise de Algoritmo, UNIBH, 7 periodo. O Objetivo do trabalho \n        foi de implementar os seguintes algoritmos de ordenação: Inserção, Bubblesort e Quicksort para \n        determinar o número de comparações e movimentações ao ordenar os arquivos Entrada1.csv e Entrada2.csv\n    \n    \";\n    \n    implementado = \"\n    \n        Neste trabalho, foi implementado os algoritmos de ordenação que informa os valores de comparações e \n        movimentações, além disso, foi implementado com a interface gráfica, utilizando TKinter, para mostrar \n        no final da execução uma tabela com as informações dos algoritmos.\n        \n    \";\n__}__\n\n\n__(ENG) {__\n  \n    description = \"\n        \n        Final Practical Work of the course Algorithm Analysis, UNIBH, 7 period. The objective of the work was\n        to implement the following sorting algorithms: Insertion, Bubblesort and Quicksort to determine the\n        number of comparisons and moves to sort the files Entrada1.csv and Entrada2.csv\n    \n    \";\n    \n    implemented = \"\n        \n        In this work, the ordering algorithms that inform the values of comparisons and movements, in addition, \n        it was implemented with the graphical interface, using TKinter, to show at the end of the execution a \n        table with the information from the algorithms.\n    \n    \";\n__}__\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmy-python-projects%2Fordination-work","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmy-python-projects%2Fordination-work","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmy-python-projects%2Fordination-work/lists"}