{"id":19427958,"url":"https://github.com/keller-michael/integer_square_root_redux","last_synced_at":"2026-06-20T09:32:14.870Z","repository":{"id":109001806,"uuid":"577651393","full_name":"Keller-Michael/integer_square_root_redux","owner":"Keller-Michael","description":"📖 different ways for integer square root redux in ABAP","archived":false,"fork":false,"pushed_at":"2022-12-21T19:52:15.000Z","size":5,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-25T05:27:38.281Z","etag":null,"topics":["abap","example","integer","measurement","runtime","sample","squareroot"],"latest_commit_sha":null,"homepage":"","language":"ABAP","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/Keller-Michael.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-12-13T08:08:58.000Z","updated_at":"2024-02-08T21:58:39.000Z","dependencies_parsed_at":null,"dependency_job_id":"b88ef1d3-1af8-4092-bc00-6789812c5b81","html_url":"https://github.com/Keller-Michael/integer_square_root_redux","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Keller-Michael/integer_square_root_redux","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Keller-Michael%2Finteger_square_root_redux","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Keller-Michael%2Finteger_square_root_redux/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Keller-Michael%2Finteger_square_root_redux/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Keller-Michael%2Finteger_square_root_redux/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Keller-Michael","download_url":"https://codeload.github.com/Keller-Michael/integer_square_root_redux/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Keller-Michael%2Finteger_square_root_redux/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34565240,"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-06-20T02:00:06.407Z","response_time":98,"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":["abap","example","integer","measurement","runtime","sample","squareroot"],"created_at":"2024-11-10T14:13:23.726Z","updated_at":"2026-06-20T09:32:14.865Z","avatar_url":"https://github.com/Keller-Michael.png","language":"ABAP","funding_links":[],"categories":[],"sub_categories":[],"readme":"# :open_book: Integer square root redux in ABAP\n\nThree different ways for integer square root redux in ABAP with a simple approach to measure runtime. Check this executable [class](/src/zcl_integer_square_roots.clas.abap) written on SAP Business Technology Platform ABAP environment (Steampunk).\n\n* First way is to calculate by brute force. That means double integer value until you get the number for which you are trying to find square root.\n* Second way use an equation. This equation says that the sum of the first \"n\" odd numbers is \"n²\". So we do that backwards and we count the number of times an increasing odd number can be subtracted from another number. Result is \"n\".\n* Third way is the standard implementation of square root in ABAP.\n\nPlease see runtimes. Results may be suprising 🤔\n\nThe whole idea to do that calculation in ABAP based on the book \"Strange Code - Esoteric languages that make programming fun again\". Many thanks to the author [Ronald T. Kneusel](https://www.rkneusel.com/) for this wonderful book. Nice to see that the world of programming languages not only consists of the \"winners\" (widely used programming languages, check TIOBE index for example).\n\nHave fun 👍\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkeller-michael%2Finteger_square_root_redux","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkeller-michael%2Finteger_square_root_redux","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkeller-michael%2Finteger_square_root_redux/lists"}