Generating sample data based on the combination of specific parameters and options is a common use case. In this post, I illustrate utilizing a simple recursive approach for generating all possible combinations from input into a dataset.| The Code Ship
OpenAI is absent from sponsored conferences in 2025—yet more present than ever. This post explores what their silence means, how it reflects a deeper strategic intelligence, and what educators, innovators, and system leaders can learn from it.| 🌀thisisGRAEME
Someone on the Oracle Community forum asked “Is there a way to parse unknown depth level of nested json?”. In other words, if you had a JSON structure which kept nesting data to an unkn…| Paulzip's Oracle Blog
In this blog post, we present a technique with the Rocq/Coq theorem prover to define mutually recursive functions using a notation. This is sometimes convenient for types defined using a container type, such as types depending on a list of itself.| Formal Land Blog
I’m not putting this in the lambda-calculus series, though it touches on issues from the last post in the series, but specifically issues of recursion. I was curious to go back and recall how The Little Schemer dealt with problems of recursion (and the Y Combinator (which we still haven’t got properly to yet, but we will, I promise)). In Chapter 9 of The Little Schemer (“and Again, and Again, and Again,…"), it starts off by querying the reader if they want caviar and how to find it in...| The Neo-Babbage Files
From the previous entry in this series, one of the things of note in discussing the nature of the connections between LISP and (the) lambda calculus was John McCarthy’s concern about recursion and higher-order functions. A couple of excerpts from previous quotes from McCarthy on the subject to set the stage: …And so, the way in which to [be able to handle function passing/higher order functions] was to borrow from Church’s Lambda Calculus, to borrow the lambda definition. Now, having bo...| The Neo-Babbage Files
Intro I recently wrote an article on Recursion in Ruby , and this is meant to be its Elixir counterpart. It will provide a way to compare solving the same problems in both languages and a chance to talk about some of their differences. Heads & Tails…| Leigh Halliday's RSS Feed
This article is the counterpart to one I wrote on Recursion in Elixir . What is recursion? Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed to…| Leigh Halliday's RSS Feed
So, we parsed an input - file, stream of characters or string - and we got a nicely structured data in the form of a tree and/or an algebraic data type. What now?| kubuszok.com
This week’s Fiddler is based on “Showcase Showdown” on the game show “The Price is Right”. Suppose we have some number of players. Player A is the first to spin a giant wheel, which spits out a real number chosen randomly and uniformly between 0 and 1. All spins are independent of each other. After … Continue reading "Showcase Showdown" The post Showcase Showdown first appeared on Book Proofs.| Book Proofs
This week’s Fiddler is a puzzle about adding digits over and over again. For any positive, base-10 integer $n$, define $f(n)$ as the number of times you have to add up its digits until you get a one-digit number. For example, $f(23) = 1$ because $2+3 = 5$, a one-digit number. Meanwhile, $f(888) = 2$, … Continue reading "How many times can you add up the digits?" The post How many times can you add up the digits? first appeared on Book Proofs.| Book Proofs
Table of Contents| A Scripter's Notes
The Y-Combinator. How to derive recursion in a purely functional context.| John Azariah’s Blog
One of my favorite textbooks on algorithms—in spite of the fact that it's twenty years old—is Udi Manber's Introduction to Algorithms: A Creative Approach. However, I have never been tempted to actually use it in class. You see, the book's greatest strength is also its greatest weakness.| Teaching, Playing, and Programming
I've written before about trying to diagnose students' broken or ineffective mental models from the mistakes they make. Here's a mistake that I see frequently from students who are not yet comfortable with recursion.| Teaching, Playing, and Programming
Ada is not the first language that comes to mind when you want to do functional programming. (You in the back, stop laughing!) Why, with excellent functional programming languages like Haskell or ML easily available, would I choose to do a functional programming project in Ada? (I CAN STILL HEAR YOU LAUGHING!) Partly because we use Ada in some courses at our institution, and I wanted a library that could help in teaching recursion to novices. But, honestly, mostly I just wanted to see if i...| Teaching, Playing, and Programming
Product SubArray Given a list of 4 or more numbers, write a script to find the contiguous sublist that has the maximum product. The length of the sublist is irrelevant; your job is to maximize the product. Example Input:...| E. Choroba
Excel Column Write a script that accepts a number and returns the Excel Column Name it represents and vice-versa. Excel columns start at A and increase lexicographically using the 26 letters of the English alphabet, A..Z. After Z, the...| E. Choroba
Shortest Unique Prefix Write a script to find the shortest unique prefix for each each word in the given list. The prefixes will not necessarily be of the same length. Sample Input [ "alphabet", "book", "carpet", "cadmium", "cadeau", "alpine"...| E. Choroba
Diff-K You are given an array @N of positive integers (sorted) and another non negative integer $k. Write a script to find if there exists 2 indices $i and $j such that $A[$i] - $A[$j] == $k and $i...| E. Choroba
Kth Permutation Sequence Write a script to accept two integers n (>=1) and k (>=1). It should print the k-th permutation of n integers. For example, n=3 and k=4, the possible permutation sequences are listed below: 123 132 213...| E. Choroba
Rotate Matrix Write a script to rotate the following matrix by given 90/180/270 degrees clockwise. [ 1, 2, 3 ] [ 4, 5, 6 ] [ 7, 8, 9 ] For example, if you rotate by 90 degrees then...| E. Choroba
In this post, I break down my Advent of Code Day 1 solution and dive into how you can use recursion, pattern matching and custom guard clauses to implement even complex logic and control flow in an easy-to-reason about way that also avoids common time complexity pitfalls.| The Great Code Adventure