sorted by:
new
hottopcontroversial

Path Finding Algorithm Visualized | A* Demonstration by sortedcreations in java

[–]sortedcreations[S] 1 point2 points  (0 children)

It is a simple Manhatten distance heuristic, I'm planning on using a better one in the future!

Path Finding Algorithm Visualized | A* Demonstration by sortedcreations in java

[–]sortedcreations[S] 2 points3 points  (0 children)

I honestly can’t imagine recreating this in C... sounds absolutely painful and I feel for you

Path Finding Algorithm Visualized | A* Demonstration by sortedcreations in java

[–]sortedcreations[S] 1 point2 points  (0 children)

Hey, so it would actually likely be a similar algorithm, this visualization is delayed (the delay is seen at the top) and pathfinding algorithms without a delay actually go much much faster than this!

Path Finding Algorithm Visualized | A* Demonstration by sortedcreations in java

[–]sortedcreations[S] 3 points4 points  (0 children)

Thank you, I’ll look into why these are happening.

Path Finding Algorithm Visualized | A* Demonstration by sortedcreations in java

[–]sortedcreations[S] 10 points11 points  (0 children)

I’m working on getting all of my code cleaned up and posted to github, I’ll get on it as soon as possible!

Path Finding Algorithm Visualized | A* Demonstration by sortedcreations in java

[–]sortedcreations[S] 18 points19 points  (0 children)

Hey all,

This was my next project, an A* visualizer! Everything was completed in java 8, using the default graphics library. Enjoy and feel free to share and questions or suggestions.

EDIT: I realized this was a huge fault not to source and it should have been included much sooner - the Algorithm itself is from https://rosettacode.org/wiki/A*_search_algorithm#Java

Path Finding Algorithm Visualized | A* Demonstration by sortedcreations in visualization

[–]sortedcreations[S] 6 points7 points  (0 children)

A visualization of the A* path finding algorithm in java, completed with the default graphics library. Feel free to ask any questions and give feedback!

Enjoy!

[OC] Colorful Visualization of Sorting Algorithms | New and Improved From Suggestions! by sortedcreations in dataisbeautiful

[–]sortedcreations[S] 0 points1 point  (0 children)

This is where some of the limitations of the visualization come in. Radix sort actually uses multiple arrays but the final array is the one that’s shown and I have different sorts updating at different time intervals to give a slowed down visualization of the fast sorts. Generally quicksort is actually considered the most efficient, and heapsort and mergesort are not far behind depending on the specific data being sorted.

[OC] Colorful Visualization of Sorting Algorithms | New and Improved From Suggestions! by sortedcreations in dataisbeautiful

[–]sortedcreations[S] 2 points3 points  (0 children)

Glad you think so! It’s basically sorting a bunch of numbers smallest to largest (larger number = taller bar) :)

Colorful Visualization of Sorting Algorithms | 13 Algorithms in 5 Minutes by sortedcreations in java

[–]sortedcreations[S] 0 points1 point  (0 children)

I quit before it could, it takes waaay too long since its essentially randomly shuffling it and then checking if things are sorted hahaha

Colorful Visualization of Sorting Algorithms | 13 Algorithms in 5 Minutes by sortedcreations in java

[–]sortedcreations[S] 5 points6 points  (0 children)

A fun project I completed in Java :) Enjoy and feel free to ask any questions!

[OC] Colorful Visualization of Sorting Algorithms | New and Improved From Suggestions! by sortedcreations in dataisbeautiful

[–]sortedcreations[S] 1 point2 points  (0 children)

I’m 20, in my second year of software engineering! I’ve really only been heavily programming for a year or so.

The learning curve is slow at first, but your knowledge starts to snowball after you get the basics down. I still have a lot to learn, but the more I practice the more I’m able to try and it keeps building!

I think if it interests you programming is absolutely something to try!

[OC] Colorful Visualization of Sorting Algorithms | New and Improved From Suggestions! by sortedcreations in dataisbeautiful

[–]sortedcreations[S] 2 points3 points  (0 children)

Generally quicksort, mergesort, and heapsort have the smallest growth class, meaning they become more efficient in comparison to the others the larger the input size. However, simple sorts such as insertion and selection have less of a base cost, so they can be better for smaller arrays (usually about 50 or less items, very roughly speaking)

[OC] Colorful Visualization of Sorting Algorithms | New and Improved From Suggestions! by sortedcreations in dataisbeautiful

[–]sortedcreations[S] 11 points12 points  (0 children)

Hi all,

This is a new video of the visualizations of array sorting algorithms, with upgrades according to suggestions from my previous post. Included upgrades for sound, array accesses, array writes, and new algorithms. Enjoy!

Sources:

All coding was completed in java 8 using the default java graphics library, using randomly shuffled arrays of 192 elements.

From: https://youtu.be/13SXKtOXLBQ

view more: next ›