{"id":21542329,"url":"https://github.com/allalgorithms/apple-script","last_synced_at":"2025-09-12T21:22:21.026Z","repository":{"id":96318618,"uuid":"149302618","full_name":"AllAlgorithms/apple-script","owner":"AllAlgorithms","description":"Implementation of All ▲lgorithms in AppleScript Programming Language","archived":false,"fork":false,"pushed_at":"2020-10-02T06:11:32.000Z","size":10,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-01T12:10:34.753Z","etag":null,"topics":["algorithms","allalgorithms","applescript","hacktoberfest"],"latest_commit_sha":null,"homepage":"","language":"AppleScript","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/AllAlgorithms.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":".github/contributing.md","funding":null,"license":"license","code_of_conduct":".github/code-of-conduct.md","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":"2018-09-18T14:32:12.000Z","updated_at":"2023-05-16T23:01:46.000Z","dependencies_parsed_at":null,"dependency_job_id":"d72bb996-4efe-4320-bc18-7f9ba43ac0b8","html_url":"https://github.com/AllAlgorithms/apple-script","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AllAlgorithms/apple-script","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Fapple-script","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Fapple-script/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Fapple-script/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Fapple-script/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AllAlgorithms","download_url":"https://codeload.github.com/AllAlgorithms/apple-script/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AllAlgorithms%2Fapple-script/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274879245,"owners_count":25367095,"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","status":"online","status_checked_at":"2025-09-12T02:00:09.324Z","response_time":60,"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":["algorithms","allalgorithms","applescript","hacktoberfest"],"created_at":"2024-11-24T05:09:15.427Z","updated_at":"2025-09-12T21:22:20.964Z","avatar_url":"https://github.com/AllAlgorithms.png","language":"AppleScript","readme":"We are accepting all pull requests. [Read More](https://github.com/AllAlgorithms/algorithms/issues/40)\n\n\u003cdiv align=\"center\" id=\"top\"\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cimg width=\"500\" height=\"350\" src=\"https://cdn.abranhe.com/projects/algorithms/logo.svg\" alt=\"Algorithms Logo\"\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\t\u003cbr\u003e\n\n\u003cp\u003e\n\t\u003ca href=\"#what-is-an-algorithm\"\u003eWhat is an algorithm?\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\t\u003ca href=\"https://github.com/AllAlgorithms/algorithms/blob/master/.github/contributing.md\"\u003eContributing\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\t\u003ca href=\"https://www.redbubble.com/people/abranhe/works/34285088\"\u003eStickers \u0026 T-Shirts\u003c/a\u003e\n\u003c/p\u003e\n\n\n\u003cp\u003e\n\u003ca href=\"https://twitter.com/AllAlgorithms\"\u003e\n  \u003cimg src=\"https://cdn.svgporn.com/logos/twitter.svg\" width=\"17px\"\u003e Twitter\n\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\u003ca href=\"https://instagram.com/AllAlgorithms\"\u003e\n  \u003cimg src=\"https://www.instagram.com/static/images/ico/apple-touch-icon-152x152-precomposed.png/419a6f9c7454.png\" width=\"17px\"\u003e Instagram\n\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\u003ca href=\"https://github.com/AllAlgorithms\"\u003e\n  \u003cimg src=\"https://img.icons8.com/ios-glyphs/90/333333/github.png\" width=\"18px\"\u003e Github\n\u003c/a\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\n\u003c/p\u003e\n\n\u003cbr\u003e\n\u003cp align=\"center\"\u003e\n  \u003ci\u003eHuge collection of All ▲lgorithms implemented in multiple languages\u003c/i\u003e\n\u003c/p\u003e\n\u003cbr\u003e\n\n\u003ca href=\"https://github.com/AllAlgorithms\"\u003e\u003cimg src=\"https://cdn.abranhe.com/projects/algorithms/badge.svg\" /\u003e\u003c/a\u003e\n\u003ca href=\"https://cash.me/$abranhe\"\u003e\u003cimg src=\"https://cdn.abranhe.com/badges/cash-me.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://paypal.me/abranhe/10\"\u003e\u003cimg src=\"https://cdn.abranhe.com/badges/paypal.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://patreon.com/abranhe\"\u003e\u003cimg src=\"https://cdn.abranhe.com/badges/patreon.svg\" /\u003e\u003c/a\u003e\n\n\u003c/div\u003e\n\n## See\n\n- [What is an algorithm](#what-is-an-algorithm)\n- [Contributing](https://github.com/AllAlgorithms/algorithms/blob/master/.github/contributing.md)\n- [Code of Conduct](https://github.com/AllAlgorithms/algorithms/blob/master/.github/code-of-conduct.md)\n- [Stickers and T-Shirts](https://www.redbubble.com/people/abranhe/works/34285088)\n- [Twitter](https://twitter.com/AllAlgorithms)\n- [Instagram](https://instagram.com/AllAlgorithms)\n- [Algorithms Categories](#categories)\n- [Maintainers](#maintainers)\n- [License](#license)\n\n\n## What is an algorithm?\n\nInformally, an algorithm is any well-defined computational procedure that takes\nsome value, or set of values, as input and produces some value, or set of values, as\noutput. An algorithm is thus a sequence of computational steps that transform the\ninput into the output.\n\nAn algorithm should have three important characteristics to be considered valid:\n\n- **It should be finite**: If your algorithm never ends trying to solve the problem\nit was designed to solve then it is useless\n- **It should have well defined instructions**: Each step of the algorithm has to\nbe precisely defined; the instructions should be unambiguously specified for each case.\n- **It should be effective**: The algorithm should solve the problem it was designed\nto solve. And it should be possible to demonstrate that the algorithm converges with\njust a paper and pencil.\n\n## Categories\n\n\u003e Structure of The All ▲lgoritms project\n\n- [Artificial Intelligence](#artificial-intelligence)\n- [Backtracking](#backtracking)\n- [Bit Manipulation](#bit-manipulation)\n- [Cellular Automaton](#cellular-automaton)\n- [Ciphers](#ciphers)\n- [Computational Geometry](#computational-geometry)\n- [Cryptography](#cryptography)\n- [Data Structures](#data-structures)\n- [Divide and conquer](#divide-and-conquer)\n- [Dynamic Programming](#dynamic-programming)\n- [Gaming Theory](#gaming-theory)\n- [Graphs](#graphs)\n- [Greedy Algorithms](#greedy-algorithms)\n- [Math](#math)\n- [Networking](#networking)\n- [Numerical Analysis](#numerical-analysis)\n- [Operating system](#operating-system)\n- [Randomized Algorithms](#randomized-algorithms)\n- [Searches](#searches)\n- [Selections Algorithms](#selections-algorithms)\n- [Sorting](#sorting)\n- [Strings](#strings)\n- [Online Challenges](#online-challenges)\n- [Others](#others)\n\n## [Artificial Intelligence](artificial-intelligence)\n\n- [Density-based spatial clustering of applications with noise (DBSCAN Clustering)](https://allalgorithms.com/docs/dbscan)\n- [Interactive Self-Organizing Data Analysis Technique yAy! (ISODATA Clustering)](https://allalgorithms.com/docs/isodata)\n- [Linear Regression](https://allalgorithms.com/docs/linear-regression)\n- [Logistic Regression](https://allalgorithms.com/docs/logistic-regression)\n- [Neutral Style Transfer](https://allalgorithms.com/docs/neutral-style-transfer)\n- [SATisfiable (SAT)](https://allalgorithms.com/docs/sat)\n- [Travelling salesman problem (TSP)](https://allalgorithms.com/docs/tsp)\n- [A* (A Star)](https://allalgorithms.com/docs/a-star)\n- [Artificial Neutral Network](https://allalgorithms.com/docs/artificial-neutral-network)\n- [Convolutional Neutral Network](https://allalgorithms.com/docs/convolutional-neutral-network)\n- [Decision Tree](https://allalgorithms.com/docs/decision-tree)\n- [Factorization Machines](https://allalgorithms.com/docs/factorization-machines)\n- [Gaussian Mixture Model](https://allalgorithms.com/docs/gaussian-mixtrue-model)\n- [Gradient Boosting Trees](https://allalgorithms.com/docs/gradient-boostring-trees)\n- [Hierachical Clustering](https://allalgorithms.com/docs/hierachical-clustering)\n- [Image Processing](https://allalgorithms.com/docs/image-processing)\n- [K Nearest Neighbors](https://allalgorithms.com/docs/k-nearest-neighbors)\n- [K Means](https://allalgorithms.com/docs/k-means)\n- [Minimax](https://allalgorithms.com/docs/minimax)\n- [Native Bayes](https://allalgorithms.com/docs/native-bayes)\n- [Nearest Sequence Memory](https://allalgorithms.com/docs/nearest-sequence-memory)\n- [Neutral Network](https://allalgorithms.com/docs/neutral-network)\n- [Perceptron](https://allalgorithms.com/docs/perceptron)\n- [Principal Component Analysis](https://allalgorithms.com/docs/principal-component-analysis)\n- [Q Learing](https://allalgorithms.com/docs/q-learning)\n- [Random Forests](https://allalgorithms.com/docs/random-forest)\n- [Restricted Boltzman Machine](https://allalgorithms.com/docs/restricted-boltzman-machine)\n\n## [Backtracking](backtracking)\n\n- [Algorithm X](backtracking/algorithm-x)\n- [Crossword Puzzle](backtracking/crossword-Puzzle)\n- [Knight Tour](backtracking/knight-tour)\n- [M Coloring Problem](backtracking/m-coloring-problem)\n- [N Queen](backtracking/n-queen)\n- [Number of ways in Maze](backtracking/number-of-ways-in-maze)\n- [Partitions of set](backtracking/partitions-of-set)\n- [Permutation of Strings](backtracking/permutation-of-strings)\n- [Powerset](backtracking/powerset)\n- [Rat in maze](backtracking/rat-in-maze)\n- [Subset Sum](backtracking/subset-sum)\n- [Sudoku Solve](backtracking/sudoku-solve)\n\n## [Bit Manipulation](bit-manipulation)\n\n- [Addition using bits](bit-manipulation/adding-using-bits)\n- [Bit divisor](bit-manipulation/bit-divisor)\n- [Byte swapper](bit-manipulation/byte-swapper)\n- [Convert numbers to binary](bit-manipulation/convert-numbers-to-binary)\n- [Count set bits](bit-manipulation/count-set-bits)\n- [Flip bits](bit-manipulation/flip-bits)\n- [Hamming distance](bit-manipulation/hamming-distace)\n- [Invert bit](bit-manipulation/invert-bit)\n- [Lonely integer](bit-manipulation/lonely-integer)\n- [Magic Number](bit-manipulation/magic-number)\n- [Maximum XOR Value](bit-manipulation/maximun-xor-value)\n- [Power of 2](bit-manipulation/power-of-2)\n- [Subset Generation](bit-manipulation/subset-generation)\n- [Sum binary numbers](bit-manipulation/sum-binary-numbers)\n- [Sum equals XOR](bit-manipulation/sum-equals-xor)\n- [Thrice unique number](bit-manipulation/thrice-unique-number)\n- [Twice unique number](bit-manipulation/twice-unique-number)\n- [XOR Swap](bit-manipulation/xor-swap)\n\n## [Cellular Automaton](cellular-automaton)\n\n- [Brians Brain](cellular-automaton/brians-brain)\n- [Conways Game of life](cellular-automaton/conways-game-of-life)\n- [Elementary Cellular Automata](cellular-automaton/elementary-cellular-automata)\n- [Generic Algorithm](cellular-automaton/generic-algorithm)\n- [Langtons Ant](cellular-automaton/langtons-ant)\n- [Nobili Cellular Automata](cellular-automaton/nobili-cellular-automata)\n- [Von Neoumann Cellular Automata](cellular-automaton/von-neoumann-cellular-automata)\n\n## [Computational Geometry](computational-geometry)\n\n- [2D Line intersection](computational-geometry/)\n- [2D Separating Axis test](computational-geometry/)\n- [Area of polygon](computational-geometry/)\n- [Area of triangle](computational-geometry/)\n- [Axis aligned bounding box collision](computational-geometry/)\n- [Bresenham Line](computational-geometry/)\n- [Chans Algorithm](computational-geometry/)\n- [Cohen Sutherland Lineclip](computational-geometry/)\n- [Distance between points](computational-geometry/)\n- [Graham Scan](computational-geometry/)\n- [Halfplane intersection](computational-geometry/)\n- [Jarvis March](computational-geometry/)\n- [Quickull](computational-geometry/)\n- [Sphere tetrahedron intersection](computational-geometry/)\n- [Sutherland Hodgeman clipping](computational-geometry/)\n\n## [Cryptography](cryptography)\n\n- [Affine Cipher](cryptography/)\n- [Atbash Cipher](cryptography/)\n- [Autokey Cipher](cryptography/)\n- [Baconian Cipher](cryptography/)\n- [Caesar Cipher](cryptography/)\n- [Colummnar Cipher](cryptography/)\n- [Vigenere Cipher](cryptography/)\n\n## [Data Structures](data-structures)\n\n- [Bag](data-structures/bag/)\n- [Hashes](data-structures/hashes/)\n- [Linked List](data-structures/linked-list/)\n- [List](data-structures/list/)\n- [Queue](data-structures/queue/)\n- [Stack](data-structures/stack/)\n- [Tree](data-structures/tree/)\n\n## [Divide and conquer](divide-and-conquer)\n\n- [Strassen Matrix Manipulation](divide-and-conquer/)\n- [Closest Pair of Point](divide-and-conquer/)\n- [Inversion Count](divide-and-conquer/)\n- [Karatsuba Multiplication](divide-and-conquer/)\n- [Maximum Contiguous subsequence sum](divide-and-conquer/)\n- [Merge Sort using divide and conquer](divide-and-conquer/)\n- [Quick Sort using divide and conquer](divide-and-conquer/)\n- [Tournament Method to find min max](divide-and-conquer/)\n- [Warnock Algorithm](divide-and-conquer/)\n- [X Power Y](divide-and-conquer/)\n\n## [Dynamic Programming](dynamic-programming)\n\n- [Array Median](dynamic-programming)\n- [Optima Binary Search Tree](dynamic-programming)\n- [Binomial Coefficient](dynamic-programming)\n\n## [Gaming Theory](gaming-theory)\n\n- [Nim Next Best Move Game](gaming-theory/)\n- [Nim Win Loss Game](gaming-theory/)\n- [Grundy Numbers Kayle Game](gaming-theory/)\n\n## [Graphs](graphs)\n\n- [Bipartite Check](graphs/)\n- [Adjacency Lists graphs representation](graphs/)\n- [A* (A Star)](https://allalgorithms.com/docs/a-star)\n\n## [Greedy Algorithms](greedy-algorithms)\n\n- [Activity Selection](greedy-algorithms)\n- [Dijkstra Shortest Path](greedy-algorithms)\n- [Egyptian Fraction](greedy-algorithms)\n\n## [Math](math)\n\n- [2 Sum](math/)\n- [Add Polynomials](math/)\n- [Amicable Numbers](math/)\n- [Armstrong Numbers](math/)\n- [Automorphic Numbers](math/)\n- [Average Stream Numbers](math/)\n- [Babylonian Method](math/)\n- [Binomial Coefficient](math/)\n- [Catalan Number](math/)\n- [Check is Square](math/)\n- [Convolution](math/)\n- [Coprime Numbers](math/)\n- [Count Digits](math/)\n- [Count Trailing Zeroes](math/)\n- [Decoding of String](math/)\n- [Delannoy Number](math/)\n- [Derangements](math/)\n- [DFA Division](math/)\n- [Diophantine](math/)\n- [Divided Differences](math/)\n- [Euler Totient](math/)\n- [Exponentiation Power](math/)\n- [Factorial](math/factorial)\n- [Fast Fourier transform](math/)\n- [Fast inverse (sqrt) Square Root](math/)\n\n## [Networking](networking)\n\n- [Packet Sniffer](networking/)\n- [Determine Endianess](networking/)\n- [Validate IP](networking/)\n\n## [Numerical Analysis](numerical-analysis)\n\n- [Integral](numerical-analysis/integral)\n- [Monte Carlo](numerical-analysis/monte-carlo)\n- [Runge Kutt](numerical-analysis/runge-kutt)\n\n## [Operating system](operating-system)\n\n- [Currency](operating-system/)\n- [Deadlocks](operating-system/)\n- [Memory Management](operating-system/)\n- [Scheduling](operating-system/)\n- [Shell](operating-system/)\n\n## [Randomized Algorithms](randomized-algorithms)\n\n- [Birthday Paradox](randomized-algorithms)\n- [Karger Minimum Cut Algorithm](randomized-algorithms)\n- [Kth Smallest Element Algorithm](randomized-algorithms)\n- [Random from Stream](randomized-algorithms)\n- [Random Node Linked list](randomized-algorithms)\n- [Randomized Quicksort](randomized-algorithms)\n- [Reservoir Sampling](randomized-algorithms)\n- [Shuffle an Array](randomized-algorithms)\n\n## [Searches](searches)\n\n- [Binary Search](searches)\n- [Exponential Search](searches)\n- [Fibonacci Search](searches)\n- [Fuzzy Search](searches)\n- [Interpolation Search](searches)\n- [Jump Search](searches)\n- [Linear Search](searches)\n- [Ternay Search](searches)\n\n## [Selections Algorithms](selections-algorithms)\n\n- [Median of Medians](selections-algorithms)\n- [Quick Select](selections-algorithms)\n\n## [Sorting](sorting)\n\n- [Bead Sort](sorting/)\n- [Bogo Sort](sorting/)\n- [Bubble Sort](sorting/)\n- [Bucket Sort](sorting/)\n- [Circle Sort](sorting/)\n- [Comb Sort](sorting/)\n- [Counting Sort](sorting/)\n- [Cycle Sort](sorting/)\n- [Flash Sort](sorting/)\n- [Gnome Sort](sorting/)\n- [Heap Sort](sorting/)\n- [Insertion Sort](sorting/)\n- [Intro Sort](sorting/)\n- [Median Sort](sorting/)\n- [Merge Sort](sorting/)\n- [Pipeonhole Sort](sorting/)\n- [Quick Sort](sorting/)\n- [Radix Sort](sorting/)\n- [Selection Sort](sorting/)\n- [Shaker Sort](sorting/)\n- [Shell Sort](sorting/)\n- [Sleep Sort](sorting/)\n- [Stooge Sort](sorting/)\n- [Topological Sort](sorting/)\n- [Tree Sort](sorting/)\n\n## [Strings](strings)\n\n- [Aho Corasick Algorithm](strings)\n- [Anagram Search](strings)\n- [Arithmetic on large numbers](strings)\n- [Boyer Moore Algorithm](strings)\n- [Finite Automata](strings)\n- [Kasai Algorithm](strings)\n- [Kmp Algorithm](strings)\n- [Levenshteing Distance](strings)\n- [Lipogram Checker](strings)\n\n## [Online Challenges](online-challenges)\n\n- [Coderbyte](online-challenges/coderbyte)\n- [Code Chef](online-challenges/code-chef)\n- [Code Eval](online-challenges/code-eval)\n- [Hackerearth](online-challenges/hackerearth)\n- [Hackerrank](online-challenges/hackerrank)\n- [LeetCode](online-challenges/leetcode)\n- [Project Euler](online-challenges/project-euler)\n- [Rosalind](online-challenges/rosalind)\n- [SPOJ](online-challenges/spoj)\n- [Top Coder](online-challenges/top-coder)`\n\n## [Others](others)\n\n- [Average](others/)\n- [Biggest of n numbers](others/)\n- [Biggest Suffix](others/)\n- [Fifteen Puzzle](others/)\n- [Jaccard Similarity](others/)\n- [Jose Phus Problem](others/)\n- [Lapindrom Checker](others/)\n- [Leap Year](others/)\n- [Magic Square](others/)\n- [Majority Element](others/)\n- [Minimum subarray size with degree](others/)\n- [No operator addition](others/)\n- [Paint fill](others/)\n- [Split list](others/)\n- [Tokenizer](others/)\n- [Unique number](others/)\n\n## License\n\nThis work is released under MIT License.\n\nTo the extent possible under law, [Abraham Hernandez (@abranhe)](https://go.abranhe.com/github) has waived all copyright and related or neighboring rights to this work.\n\n\u003cdiv align=\"center\"\u003e\n\t\u003ca href=\"https://github.com/abranhe/algorithms\"\u003e\n\t\t\u003cimg src=\"https://cdn.abranhe.com/projects/algorithms/logo.svg\" width=\"50px\"\u003e\n\t\u003c/a\u003e\n  \u003cbr\u003e\n\u003c/div\u003e","funding_links":["https://paypal.me/abranhe/10","https://patreon.com/abranhe"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fallalgorithms%2Fapple-script","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fallalgorithms%2Fapple-script","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fallalgorithms%2Fapple-script/lists"}