{"id":15524698,"url":"https://github.com/hellofromtonya/udacity-dsand-project1","last_synced_at":"2026-04-22T09:02:03.033Z","repository":{"id":98370131,"uuid":"186190569","full_name":"hellofromtonya/udacity-dsand-project1","owner":"hellofromtonya","description":"Udacity Project: Unscramble Computer Science Problems","archived":false,"fork":false,"pushed_at":"2019-05-12T15:27:17.000Z","size":156,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-05T20:36:47.077Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hellofromtonya.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","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":"2019-05-11T23:22:11.000Z","updated_at":"2019-05-12T15:25:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"7465648c-4cb4-451f-baa4-7513163d48bd","html_url":"https://github.com/hellofromtonya/udacity-dsand-project1","commit_stats":{"total_commits":6,"total_committers":1,"mean_commits":6.0,"dds":0.0,"last_synced_commit":"c56bd5fc1f4d584090c6e54c155eb473ff52f280"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hellofromtonya/udacity-dsand-project1","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hellofromtonya%2Fudacity-dsand-project1","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hellofromtonya%2Fudacity-dsand-project1/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hellofromtonya%2Fudacity-dsand-project1/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hellofromtonya%2Fudacity-dsand-project1/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hellofromtonya","download_url":"https://codeload.github.com/hellofromtonya/udacity-dsand-project1/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hellofromtonya%2Fudacity-dsand-project1/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32128704,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-22T08:34:57.708Z","status":"ssl_error","status_checked_at":"2026-04-22T08:34:55.583Z","response_time":58,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":[],"created_at":"2024-10-02T10:52:45.887Z","updated_at":"2026-04-22T09:02:03.014Z","avatar_url":"https://github.com/hellofromtonya.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSAND Project 1 -  Unscramble Computer Science Problems\n\nThis repository is part of the Udacity [Data Structures \u0026 Algorithms Nanodegree program](https://www.udacity.com/course/data-structures-and-algorithms-nanodegree--nd256).\n\nThis project has 4 tasks to be completed.\n\n1. Implement an algorithm for each task.\n2. It should only print what the instructions require.\n3. Each task should be analyzed to determine the worst case time complexity of Big O.\n\nIn this project, we are not concerned with optimizing the code.  Rather, the task is to analysis the implementation's time complexity.\n\nIn the `analysis` folder, I included a more detailed analysis including estimated time to execute the worst case.\n\n## Time Complexity Resources\n\nThe following documents were used for the time complexity analyzes:\n\n* Python - [TimeComplexity](https://wiki.python.org/moin/TimeComplexity)\n* [Complexity of Python Operations](https://www.ics.uci.edu/~pattis/ICS-33/lectures/complexitypython.txt)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhellofromtonya%2Fudacity-dsand-project1","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhellofromtonya%2Fudacity-dsand-project1","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhellofromtonya%2Fudacity-dsand-project1/lists"}