Some data structures and algorithms in Java

100%

Some data structures and algorithms in Java

✓ Published0🌍 Public

Last edited Sep 27, 2016

Created on Aug 12, 2016

This example implements classic data structures and algorithms in Java, including binary search trees, merge sort, quicksort, factorial, exponentiation, Fibonacci sequences, string permutation generation, and range unionization. The code uses Java’s built-in `ArrayList`, `Arrays`, and `Collections` APIs, along with custom classes like `Node`, `Tuple`, and `Unionizer`. Random test arrays are generated via `Math.floor` and `Math.random` to benchmark sorting performance, with results printed to the console. The visualization highlights the logic behind each algorithm through clear method signatures and step-by-step control flow.

AI-generated description

Data structures and algorithms in Java

Similar vizzes

Loading thumbnail…

JavaScript Arrays

This example demonstrates the fundamental array methods in JavaScript, including `range`, `filter`, `map`, `sort`, `forEach`, and `reduce`. The code uses D3 v6’s `ascending` and `decending` imports to properly sort arrays, while also showcasing custom comparator functions. It works with a simple generated range of numbers and a small dataset of key-value entries, logging results to the console. The page renders only the static title “JavaScript Arrays” with no visual output, focusing entirely on algorithmic array manipulation.

AAndre J Denais

60% match

Loading thumbnail…

Java Script Arrays

This example demonstrates JavaScript array manipulation using D3's `ascending` method to sort an array of objects by their `key` property. The code includes commented-out demonstrations of `forEach`, `filter`, `map`, and `reduce` operations, alongside an uncommented `sort` call that orders entries alphabetically. It uses a custom `range` function to generate a numeric array and imports `ascending` from D3 7.6.1, showcasing basic functional programming techniques in a minimal HTML page with no visual output.

LLouis Astorg

59% match

Loading thumbnail…

quickSort.js

This example visualizes the recursive quicksort algorithm sorting a small numeric array, showing the step-by-step partition process and final sorted order. The code defines a `quickSort` function that selects a pivot from the middle of the array, uses two pointers to swap elements out of place, and recursively sorts the subarrays on either side. It demonstrates the algorithm’s logic directly in JavaScript with console output, using no external libraries. The rendering approach is textual, logging the unsorted and sorted arrays to the console, while the source data is a hardcoded array `[7, 0, 2, 1, 9, 2]`. The example highlights the algorithm’s core mechanics rather than a graphical chart.

WWill Carter

58% match

Loading thumbnail…

JavaScript Arrays

This example demonstrates how JavaScript’s built-in array methods can transform and organize data, specifically by sorting an array of objects by their `key` property. It shows the result of calling `entries.sort((a,b) => a.key < b.key ? -1:1)`, which arranges the entries alphabetically by key. The code also includes commented-out examples of `filter`, `map`, `reduce`, and numeric sorting with comparator functions, illustrating pitfalls like lexicographic sorting of numbers. The implementation relies solely on native JavaScript array APIs, with no external libraries or rendering, outputting results to the console.

Kkwambokar

58% match

Loading thumbnail…

This is my technical interview cheat sheet. Feel free to fork it or do whatever you want with it. PLEASE let me know if there are any errors or if anything crucial is missing. I will add more links soon.

This interactive study guide presents a hierarchical cheat sheet for technical interview preparation, organizing data structures and search algorithms into collapsible sections. The visualization is built as a GitHub gist using Markdown, with structured headings and formatting to delineate topics like Arrays, Linked Lists, Hash Tables, and Binary Trees, alongside Big O efficiency charts. It uses plain text and list rendering rather than graphical primitives, with the layout derived from the document’s outline hierarchy, making it a text-based reference tool rather than a data-driven graphic.

IIoTeacher

57% match

Loading thumbnail…

JavaScript Arrays

This example demonstrates JavaScript array manipulation techniques, including `forEach`, `filter`, `sort`, `map`, and `reduce`, using a generated range of numbers and an array of key-value objects. The code highlights sorting differences between default lexicographic ordering and numeric sorting with a comparator, as well as using the `ascending` helper from d3. It also shows how `reduce` can transform an array into an object or sum values. The visualization is a code-based teaching tool with no visual output, focusing on logged results in the console.

Ppawelsapiecha

57% match

Loading thumbnail…

This is my technical interview cheat sheet. Feel free to fork it or do whatever you want with it. PLEASE let me know if there are any errors or if anything crucial is missing. I will add more links soon.

This cheat sheet presents a structured overview of computer science topics, including data structures and search algorithms, with definitions and Big O efficiency ratings. The visual arrangement organizes content into clear sections for arrays, linked lists, hash tables, binary trees, and breadth-first search. The example is a Markdown document from a GitHub gist, authored by Legaspi21, and rendered as a text-based reference guide. The piece is designed for easy forking and editing by other users seeking interview preparation material.

LLegaspi21

57% match

Loading thumbnail…

JS Fundamentals

This example demonstrates core JavaScript array operations implemented by hand, including range generation, filtering, sorting, mapping, and reducing. The code uses D3 v7’s `ascending` comparator within a custom `sort` function to order objects by key, then reduces an array of key-value pairs into a single object. All logic runs in the browser console, producing logged output for each step; the page itself is intentionally blank, with SVG shapes referenced only in the README. The visualization relies purely on native JavaScript methods and D3’s utility functions, with no graphical rendering.

Yyankesswang

57% match