FizzBuzz in Haskell

100%

FizzBuzz in Haskell

✓ Published0🌍 Public

Last edited Feb 4, 2017

Created on Feb 4, 2017

This example demonstrates the classic FizzBuzz algorithm implemented in Haskell, printing results for numbers 1 through 100 to the console. The code defines three pure functions—`fizzbuzz`, `fizz`, and `buzz`—which use Haskell’s `mod` operator for divisibility checks and string concatenation to build each output line. The `main` function leverages the `mapM_` function with `putStrLn` to sequentially output each line, using a list comprehension to generate the input range. No external libraries are used; the example relies solely on Haskell’s standard Prelude, and it is compiled with GHC as shown in the comments.

AI-generated description

Similar vizzes

Loading thumbnail…

FizzBuzz in Scala

This example demonstrates a functional implementation of FizzBuzz for numbers 1 through 30, using Scala’s pattern matching with custom extractors. The code defines a `MultipleOf` case class whose `unapply` method returns `Some(x/n)` when the input is divisible by `n`, enabling concise matching against `multipleOfThree`, `multipleOfFive`, and `multipleOfFifteen`. Each number is mapped through a `fizzbuzz` function that returns the appropriate string or the original integer, then printed sequentially via `map println`. The example highlights Scala’s case classes, partial functions, and the map-collect-print idiom.

PP7h

76% match

Loading thumbnail…

FizzBuzz with simple mapping operator

This example demonstrates the FizzBuzz logic through a simple mapping operator, rendering the output sequence from 1 to 15 as a compact text visualization. The code uses the XQuery 3.0 `!` mapping operator to iterate over each number, applying a chain of conditional `mod` checks to classify values as “fizz,” “buzz,” or “fizz buzz.” The data source is the hardcoded range (1 to 15), and the rendering approach is direct string output, with no external libraries or graphical APIs involved. It shows how a classic programming puzzle can be expressed concisely using functional-style iteration and conditional logic in a single line.

CCliffordAnderson

74% match

Loading thumbnail…

Exercise: Implement FizzBuzz (Super Edition)

This example visualizes the transformation of an input array of integers through the FizzBuzz logic, displaying the resulting array where multiples of three are replaced with “Fizz,” multiples of five with “Buzz,” and multiples of both with “FizzBuzz.” The code, written in Ruby, implements two versions: an initial hash-based iteration that maps each index to its processed value, and a more concise solution using `Array#map!` to mutate the array in place. The visualization does not employ external libraries or rendering frameworks; instead, it relies solely on Ruby’s core array and hash methods to compute and output the final sequence, making the data flow explicit through the two algorithmic approaches.

EElaineYu

73% match

Loading thumbnail…

Fizz Buzz in XQuery

This example demonstrates the classic Fizz Buzz logic, where numbers divisible by 3 and 5 are replaced with the word "fizzbuzz", those divisible by only 3 with "fizz", and those divisible by only 5 with "buzz". The code iterates over a fixed range of integers from 1 to 30 using an XQuery `for` loop. It applies nested `if`/`else` expressions to evaluate the modulo conditions (`$i mod 3` and `$i mod 5`) and returns the appropriate string or the original number. The entire computation is performed entirely within XQuery 3.0, with no external libraries or data sources involved.

CCliffordAnderson

68% match

Loading thumbnail…

Leveraging Web Data Class 5 Homework

This example presents a study aid for JavaScript fundamentals, listing definitions and code snippets for variables, operators, loops, and conditional statements in static HTML. The page includes an interactive script that runs a FizzBuzz-style loop, logging “Hello World,” “Hello,” or “World” when iterating from 1 to 100 based on divisibility by 3 and 5. It uses standard JavaScript console output, with HTML heading and paragraph elements organizing the quiz-style content. The visual display is minimal, prioritizing textual explanation over graphical visualization.

PPGriner

57% match

Loading thumbnail…

Eloquent JS: Chapter 2

This example showcases the output of four JavaScript programming exercises from Chapter 2 of *Eloquent JavaScript*, rendered directly in the browser console. It demonstrates looping with `for` and `while` statements to print a triangular pattern of `#` symbols, the FizzBuzz sequence with conditional `if`/`else` logic, and a chessboard grid built through nested loops. The code uses plain JavaScript with `console.log` for output, and the accompanying HTML page uses inline CSS for styling. No external libraries are used, focusing purely on core language syntax and algorithmic thinking.

Eemberix@gmail.com

54% match

Loading thumbnail…

Leveraging Web Data Class 5 Homework

This example is a static HTML homework assignment that answers JavaScript questions and demonstrates a FizzBuzz-style loop. The page shows a series of questions about JavaScript concepts, with the provided answers and a simple script that uses a `for` loop. The loop, in combination with `if`/`else if` statements and the `console.log()` function, prints "Hello World", "Hello", "World", or the loop counter `i` to the console based on divisibility by 3 and 5. The rendering is a plain HTML text layout with a linked list of developer resources.

PPGriner

53% match

Loading thumbnail…

Knuth/McIlroy word count task using Haskell

This example demonstrates a word-frequency analysis task using Haskell, showing how to compute and display the most common words from standard input. It chains data transformations through a pipeline: converting text to lowercase, replacing non-letter characters with newlines, splitting into words, and tallying counts with a hash map. The code relies on `Data.HashMap.Strict` for efficient key-value aggregation via `HashMap.fromListWith`, and uses `Data.List` for sorting and taking the top *n* results. The final output lists each word with its count, sorted in descending order of frequency. The example highlights functional composition and lazy evaluation in a concise, read-backwards data-flow style.

FFranklin Chen

53% match