{"id":25841975,"url":"https://github.com/courseworks/ap1398ta","last_synced_at":"2026-07-25T07:31:16.971Z","repository":{"id":119844405,"uuid":"239989452","full_name":"courseworks/AP1398TA","owner":"courseworks","description":null,"archived":false,"fork":false,"pushed_at":"2020-02-12T14:12:57.000Z","size":6,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-27T11:10:32.221Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/courseworks.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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2020-02-12T10:50:01.000Z","updated_at":"2020-02-12T14:11:10.000Z","dependencies_parsed_at":"2023-04-03T15:22:03.164Z","dependency_job_id":null,"html_url":"https://github.com/courseworks/AP1398TA","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/courseworks/AP1398TA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/courseworks%2FAP1398TA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/courseworks%2FAP1398TA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/courseworks%2FAP1398TA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/courseworks%2FAP1398TA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/courseworks","download_url":"https://codeload.github.com/courseworks/AP1398TA/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/courseworks%2FAP1398TA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35871567,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-07-20T02:08:10.276Z","status":"online","status_checked_at":"2026-07-25T02:00:06.922Z","response_time":64,"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":[],"created_at":"2025-03-01T05:33:00.668Z","updated_at":"2026-07-25T07:31:16.965Z","avatar_url":"https://github.com/courseworks.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"#  In The Name Of ALLAH\n#  AP 1398 TA \n- [x] Session 1\n\n##  Session 1 - 23 Bahman 1398 - Wed 14 PM - 16 PM\n### Topics\n\n1. Github \n1. Docker\n1. Basic C++ Review\n   * Vectors\n   *  **findMin() function**: Gets a vector and returns its minimum element.\n   *  **findArgMin() function**: Gets a vector and return the index of its minimum element.\n   *  **findMinimum() function**: Gets a vector and gives its minimum element and its argmin together!\n   *  **factorial() function**: Gets a number and returns its factorial in a simple way.\n1. Recursive Algorithms\n   *  **factorail1() function**: Gets a number and returns its factorial in a recursive way.\n   *  **fibo() function**:  Gets number i and returns the i-th element of the fibonacci series in a recursive way\n1. Dynamic Programming\n   *  **fibo1() function**:  Gets number i and returns the i-th element of the fibonacci series. We used dynamic programming to compensate the simple recursive limits!\n1. Matrix-Chain Multiplication Problem\n   * Finding the minimum scalar multiplications needed for multiplying a chain of n matrices with dynamic programming. You can refer to\n[this](http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Dynamic/chainMatrixMult.htm) or the famous *CLRS algorithm book* for more information. We did this job with the **findMinOps() function**.\n1. HW1 Explained!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcourseworks%2Fap1398ta","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcourseworks%2Fap1398ta","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcourseworks%2Fap1398ta/lists"}