Algoritmos de ordenamiento en Python

100%

Algoritmos de ordenamiento en Python

✓ Published0🌍 Public

Last edited Apr 23, 2014

Created on Jul 14, 2021

Six Python sorting algorithms—bubble, insertion, merge, quicksort, selection, and shell sort—each operate on the same fixed list of ten integers, reporting their execution time and comparison count via the `time` module. The code defines separate functions for each algorithm, using global counters for comparisons, and prints the sorted list along with performance metrics. It demonstrates comparative algorithm behavior through identical input and direct measurement, with no external libraries beyond Python’s standard library.

AI-generated description

Similar vizzes

Loading thumbnail…

Sequential Sort in Snap!

This example demonstrates a sequential sort algorithm implemented in Snap!, a block-based programming environment. The code defines a reporter block that repeatedly scans an unsorted list to find the largest remaining item, inserts it at the front of a new sorted list, and deletes it from the original. The visualization shows the step-by-step process of building the sorted list. The implementation uses Snap! custom blocks, list operations like `reportListLength`, `reportListItem`, `doInsertInList`, and `doDeleteFromList`, along with nested loops and conditional logic. No external JavaScript libraries are used; the data source is the input list provided by the user.

CCliffordAnderson

50% 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

49% match

Loading thumbnail…

Some data structures and algorithms in Java

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.

KKirkHunter

49% match

Loading thumbnail…

Gist 810577150f4b252e8faa69e7060bf3af

This example presents a Clojure visualization of a custom sorting algorithm called `sorting-sort`. The code defines two functions: `remove-one`, which removes a specified item from a list using `split-with` and `rest`, and `sorting-sort`, which iteratively finds the minimum value in an unsorted collection via `apply min`, removes it, and appends it to a sorted vector within a `loop`/`recur` construct. The visualization likely animates this selection-sort-like process, though no graphical library is shown; the gist contains only the algorithmic logic without any rendering or charting API.

66ewis

49% match

Loading thumbnail…

Basic Python Usage Notes

This example presents a collection of basic Python syntax and common programming patterns, organized as reusable notes. It demonstrates loops, range, list reversal, string indexing, conditionals, searching, finding maximums, sorting, and dictionary operations using a list of fruits, numbers, and student score dictionaries. The code uses built-in functions like `enumerate()`, `reversed()`, `sorted()`, and the `range()` type to show iteration techniques. Slicing syntax on strings and lists is also illustrated, along with nested dictionary traversal. No external libraries are used; the examples rely solely on Python's standard features and data structures.

AAnsonT

48% 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

47% match

Loading thumbnail…

Bubble Sort

This example visualizes the Bubble Sort algorithm as an animated SVG bar chart. A shuffled array of 100 numbers is sorted step-by-step, with each comparison and swap rendered as a smooth transition of bar positions. The visualization uses D3 v6 to manage data binding, scales, and transitions, with bars drawn as SVG `rect` elements. Sorting steps are precomputed and replayed via `setTimeout`, triggering `render()` calls that animate x-coordinates using D3’s `transition` method.

MMTR

46% match

Loading thumbnail…

Quicksort VI

An animated quicksort network visualizes the sorting process of 100 shuffled values, with time progressing on the vertical axis and each swap rendered as a colored path. The value-to-color mapping uses a cubehelix color scale. The animation is drawn on a Canvas via `d3.transition` and custom tweening, while a precomputed list of swaps drives the sequence. Pressing the Alt key slows the animation. The implementation uses d3.v3, including ordinal and linear scales, and a custom `quicksort` function to generate swap pairs.

Mmbostock

46% match