{"id":19527853,"url":"https://github.com/valinet/ssa","last_synced_at":"2026-05-28T16:31:12.385Z","repository":{"id":108971633,"uuid":"299445379","full_name":"valinet/ssa","owner":"valinet","description":"ssa (String Search Algorithms) is a homework I had for my Algorithms Analysis course during my 2nd year in uni.","archived":false,"fork":false,"pushed_at":"2020-09-28T22:58:28.000Z","size":4677,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-26T02:30:30.155Z","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":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/valinet.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}},"created_at":"2020-09-28T22:24:02.000Z","updated_at":"2020-09-28T22:58:32.000Z","dependencies_parsed_at":"2023-04-07T11:31:26.221Z","dependency_job_id":null,"html_url":"https://github.com/valinet/ssa","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/valinet/ssa","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/valinet%2Fssa","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/valinet%2Fssa/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/valinet%2Fssa/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/valinet%2Fssa/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/valinet","download_url":"https://codeload.github.com/valinet/ssa/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/valinet%2Fssa/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33617718,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-05-28T02:00:06.440Z","response_time":99,"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":"2024-11-11T01:16:37.902Z","updated_at":"2026-05-28T16:31:12.368Z","avatar_url":"https://github.com/valinet.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ssa\nssa (String Search Algorithms) implements various substring search algorithms; I chose to do it in C and x86 (IA-32) assembly, in order to do comparisons between the two implementations, and also across the different algorithms.\n\nThe algorithms contained are:\n\n* Knuth-Morris-Pratt (KMP)\n* Rabin-Karp (RK)\n* Aho-Corasick (AC)\n\nAt the moment, it compiles as is in a Linux environment. Available options are:\n\n* Navigate to a folder containing an algorithm (for e.g., cd KMP)\n* 'make all' will compile/assemble \u0026 link everything\n* 'make runc' compiles and runs the C variant of the algorithm\n* 'make runasm' assembles and runs the x86 Intel-flavored nasm assembly version of the algorithm\n* 'make clean' cleans off binaries generated by the above commands\n\nThe makefile is set to compile the code as 32-bit, in order to do a fair comparison against the assembly version (install gcc-multilib for compiling x86 C, and nasm for assembling).\n\nMore documentation is available at \"docs/Raport.pdf\" (in Romanian).\n\nExample of invoking the resulting executables: `echo Hello world | KMP/c/kmp ll` (will highlight *ll* in *Hello world*).\n\nThe work is compatible with the Aho-Corasick problem on Infoarena: https://www.infoarena.ro/problema/ahocorasick.\n\nThe implementation has been coded as homework for my Algorithms Analysis course during my 2nd year as bachelor, Faculty of Automatic Control and Computer Science, University POLITEHNICA of Bucharest.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvalinet%2Fssa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvalinet%2Fssa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvalinet%2Fssa/lists"}