The Euclidean Algorithm in XQuery

100%

The Euclidean Algorithm in XQuery

✓ Published0🌍 Public

Last edited Mar 28, 2017

Created on Mar 28, 2017

This example demonstrates two implementations of the Euclidean algorithm in XQuery, computing the greatest common divisor of 13 and 8. The first function, `local:euclid`, uses repeated subtraction, while the second, `local:gcd`, employs the more efficient division-and-remainder method. Both functions return the result as an `xs:integer*` sequence using XQuery’s built-in arithmetic and type declarations. The code is drawn from a gist by CliffordAnderson and serves as a minimal, functional illustration of algorithmic logic in a query language.

AI-generated description

Similar vizzes

Loading thumbnail…

XQDoc Example

XQDoc Example demonstrates how XQuery 3.0 implements recursive functions, using a power-calculation function that repeatedly multiplies an integer by itself. The code defines `local:pow()` with base and recursive cases, invoking it with arguments 2 and 3 to compute 8. The example highlights XQuery's declarative recursion pattern, contrasting with iterative languages. The source is a gist by CliffordAnderson, and the rendering approach is plain text output, as no graphical or external API is employed. The function's documentation comments specify parameters, return types, and an adaptation credit to Michael Kay's StackOverflow answer.

CCliffordAnderson

61% match

Loading thumbnail…

Simple examples of higher-order functions and partial function application in XQuery

This example demonstrates higher-order functions and partial application in XQuery 3.0, using code tested with Saxon and Zorba. It shows functions that accept or return other functions, such as `local:pow` returning a function, and the `math:pow#2` built-in being partially applied with `?`. The code also illustrates fold operations (`fold-left`, `fold-right`) and sequence functions (`for-each`, `for-each-pair`, `filter`), applied to string and integer sequences. These snippets highlight how XQuery 3.0 supports functional programming patterns.

CCliffordAnderson

61% match

Loading thumbnail…

Playing with Higher Order Functions in XQuery

This example demonstrates how higher-order functions in XQuery 3.1 enable function composition for transforming numeric sequences. It shows a square function (`$map-sqr`) that uses the simple map operator (`!`) with `math:pow`, which is then fed into a reversal function (`$pow-rev`) via the `=>` arrow operator. The code applies `fn:reverse` to the input sequence before passing it to the squared map, returning the squares of the reversed order. The rendered output is computed in-memory with no external data source, purely exercising the language’s functional capabilities.

CCliffordAnderson

61% match

Loading thumbnail…

Example of a FLWOR expression

This example demonstrates a FLWOR expression in XQuery, showing how to compute the squares of odd numbers from 1 to 10 and return them in descending order. The data source is an inline numeric range, and the result sequence is produced by iterating with a `for` clause, binding each square with `let`, filtering odd values using a `where` condition, and sorting with `order by` before the final `return`. The code relies on the standard XQuery 3.0 library and its built-in arithmetic operators, with no external APIs or rendering components involved.

CCliffordAnderson

60% match

Loading thumbnail…

Euclid algorithm

This example demonstrates the Euclidean algorithm by computing the greatest common divisor of two numbers and displaying the result in the browser console. The visualization renders three circles in an SVG using D3 v7, with the `select` API from the d3 module to append SVG elements. The circles are bound to a static array of values, positioned horizontally with fixed radii, while the algorithm’s output is logged rather than visualized directly on the page. The page uses simple HTML and CSS for layout, with no interactive elements present.

NNita

59% match

Loading thumbnail…

An attempt at the Luhn algorithm in XQuery

This example demonstrates the Luhn algorithm, a checksum formula used to validate identification numbers, implemented in XQuery. It checks a sequence of sample numbers from Wikipedia, returning a boolean value indicating whether each number passes validation. The code uses the XQuery 3.1 `fn:fold-left` and `fn:sum` higher-order functions to compute digit sums, and the `fn:reverse` function to process digits from right to left. It includes a recursive `local:number-to-seq` function to convert an integer into a sequence of its digits. The source is a gist by CliffordAnderson, provided in two versions: a standalone script and a library module.

CCliffordAnderson

59% match

Loading thumbnail…

Quicksort in XQuery

This visualization compares four XQuery implementations of the quicksort algorithm, each derived from a Haskell reference, to demonstrate functional programming in a query language. It shows how the same recursive sorting logic can be expressed with different XQuery 3.1 features, including `fn:head()`, `fn:tail()`, `position()`, and a random-number generator for permutation. The code uses `local:qsort` functions with `xs:integer*` sequences, and the final example applies the sort to a shuffled list of 1 to 100 generated via `fn:random-number-generator('permute')`. The display highlights syntactical variations, such as explicit `where` clauses versus nested `if` expressions, without altering the core algorithm.

CCliffordAnderson

57% match

Loading thumbnail…

XQuery Fibonacci

This example computes the 30th Fibonacci number using a recursive XQuery function defined in a separate module. It demonstrates XQuery 3.1’s switch expression and integer arithmetic through the `local:fib` function, which calls itself until it reaches the base cases of 0 and 1. The final result is returned directly without any visualization, showing a pure server-side computation. The source code is stored as a gist by CliffordAnderson.

CCliffordAnderson

57% match