Community
0
Bubble sort rendererVisualisation of bubble sort working through an unsorted list represented by columns
1
0
0
CountSortCount Sort using Recursion
0
0
0
Ranked to-do listAllows someone to enter a list of to-do items and then helps the person rank each item in the to-do list via comparing it to each other item in the to-do list, and then prints out a ranked list. Good for analysis paralysis.
0
0
0
PNG Pixel Sorter[Written with NetBeans IDE]
Really shotty code that creates a window which receives an n amount of PNG files and sorts their pixels row by row using the quick sort algorithm, this sorting is limited by a mask created from the original image and defined by a limit value. The mask can also be inverted or have it's value changed.
The output will be 1 or 2 PNG files, a sorted png image file and a black and white mask png file.
User inputs:
Drop files
Change mask limit with slider
Choose if it will create mask png file
Preview mask with secondary window
Invert mask
Choose direction of sorting
Save png file to the same folder as the original file
ASSET SOURCE: AI image generated with Perchance
0
0
0
Mode FunctionA quick and simple function to get the mode of an array without using any modules. Can definitely be optimized, but works almost instantly under 20-50,000 objects
*time and random modules are for testing, not in the function
*averaged 0.104s to run at 50k and 0.0341s at 20k)
0
0
0
SortPackagesSorts packages according to the following rules:
A package is bulky if its volume (Width x Height x Length) is greater than or equal to 1,000,000 cm³ or when one of its dimensions is greater or equal to 150 cm.
A package is heavy when its mass is greater or equal to 20 kg.
You must dispatch the packages in the following stacks:
STANDARD: standard packages (those that are not bulky or heavy) can be handled normally.
SPECIAL: packages that are either heavy or bulky can't be handled automatically.
REJECTED: packages that are both heavy and bulky are rejected.
0
0
0
count 0 and 1count 0s and 1s and also sorts the array containing 0s, 1s and 2s
0
0
0
Comparacion de algoridmosEl codigo mide cuanto tiempo tarda cada algoridmo de busqueda visto:
QuickSort
Insertion Sort
Selection Sort
Bubble sort
Con un arreglo de tamaño N
0
0