{"id":25405125,"url":"https://github.com/akihiko47/c-experience","last_synced_at":"2025-10-07T13:21:36.529Z","repository":{"id":209903823,"uuid":"725124976","full_name":"akihiko47/C-experience","owner":"akihiko47","description":"This repository contains my experiments with the C language. My goal is to create implementations of different data structures and algorithms.","archived":false,"fork":false,"pushed_at":"2023-12-06T21:37:25.000Z","size":671,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-16T04:30:22.393Z","etag":null,"topics":["c","data-structures"],"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/akihiko47.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":"2023-11-29T13:46:13.000Z","updated_at":"2023-11-29T22:26:25.000Z","dependencies_parsed_at":"2023-12-06T21:46:30.512Z","dependency_job_id":null,"html_url":"https://github.com/akihiko47/C-experience","commit_stats":null,"previous_names":["akihiko47/c-experience"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akihiko47%2FC-experience","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akihiko47%2FC-experience/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akihiko47%2FC-experience/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akihiko47%2FC-experience/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/akihiko47","download_url":"https://codeload.github.com/akihiko47/C-experience/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248628995,"owners_count":21136183,"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":["c","data-structures"],"created_at":"2025-02-16T04:30:17.504Z","updated_at":"2025-10-07T13:21:31.507Z","avatar_url":"https://github.com/akihiko47.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 📋 C experience 📋\r\n\r\n![logo](https://github.com/akihiko47/C-experience/blob/main/images/logo.jpg?raw=true)\r\n\r\nThis repository contains my C projects. I will try to implement different data structures and algorithms using this language. \r\n\r\n## Albums file generator\r\nFile - `albumGenerator/main.c` \r\n\r\nThis project reads the albums you enter and writes them to the `albums.txt` file. This file has already been created, there you can see an example of how this program works. The album structures are stored in a dynamic array.\r\n\r\nFolder of this project: `albumGenerator`\r\n\r\n## Integers from string\r\nMain file - `intsFromString/main.c` \r\nFunction file - `intsFromString/intfromstr.c`  \r\nTests - `intsFromString/tests.c` \r\n\r\nThis program can pull a number from your string and convert it to int type. This project is an experiment with simple data types. Example of how the program works: `a12b34c5d` will be converted to `12345`. You can see tests in `tests.c`.\r\n\r\nFunction description: `int intfromstr(char * str);`\r\n\r\n# Search algorithms 🔍\r\n\r\n\r\n## Linear search\r\nFile - `Search/LinearSearch/linearsearch.c`  \r\nTests - `Search/LinearSearch/tests.c` \r\n\r\nFunction description - `int linearsearch(int array[], int n, int x);` where array - array where you need to find element, n - number of elements in array, x - element that you need to find.\r\n\r\nFunction returns index of element `x` in array. If `x` not in array function will return -1\r\n\r\n## Binary search\r\n![binary search](https://github.com/akihiko47/C-experience/blob/main/images/binary-search.jpg?raw=true)\r\nFile - `Search/BinarySearch/binsearch.c`  \r\nTests - `Search/BinarySearch/tests.c` \r\n\r\nFunction description - `int binsearch(int array[], int n, int x);` where array - array where you need to find element, n - number of elements in array, x - element that you need to find.\r\n\r\nFunction returns index of element x in array. If x not in array function will return -1. The array must be sorted!\r\n\r\n## Naive string search\r\n![naive string search](https://github.com/akihiko47/C-experience/blob/main/images/naive-string-search.jpg?raw=true)\r\n\r\nFile - `Search/StringSearchNaive/strsearchnaive.c`  \r\nTests - `Search/StringSearchNaive/tests.c` \r\n\r\nFunction description - `int strsearchnaive(char p[], char s[]);` where p (pattern) - part string that you want to find in s, s (string) - string where you want to find p.\r\n\r\nThe function returns the index of the first appearance of p in s. If there is no p in s, the function returns -1.\r\n\r\n## Knuth–Morris–Pratt (KMP) string search algorithm\r\n![kmp string search](https://github.com/akihiko47/C-experience/blob/main/images/stringsearchkmp.png?raw=true)\r\n\r\nFile - `Search/StringSearchKMP/strsearchkmp.c`  \r\nTests - `Search/StringSearchKMP/tests.c`\r\n\r\nFunction description - `int strsearchkmp(char p[], char s[]);` where p (pattern) - part string that you want to find in s, s (string) - string where you want to find p.\r\n\r\nThe function returns the index of the first appearance of p in s. If there is no p in s, the function returns -1.\r\n\r\n## Boyer–Moore (BM) string-search algorithm\r\n![bm string search](https://github.com/akihiko47/C-experience/blob/main/images/stringsearchbm.jpg?raw=true)\r\n\r\nFile - `Search/StringSearchBM/strsearchbm.c`  \r\nTests - `Search/StringSearchBM/tests.c`\r\n\r\nFunction description - `int strsearchbm(char p[], char s[]);` where p (pattern) - part string that you want to find in s, s (string) - string where you want to find p.\r\n\r\nThe function returns the index of the first appearance of p in s. If there is no p in s, the function returns -1.\r\n\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakihiko47%2Fc-experience","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fakihiko47%2Fc-experience","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakihiko47%2Fc-experience/lists"}