w0rthy/sortingvisualizer

Program to visualize, audiolize, profile, approximate runtimes for, and anything else related to sorting algorithms

sortingvisualizer's Issues

Can you please give a tutorial as to how to compile this? Trying to compile using g++ fails

Executable or Instructions on how to compile?

How do I compile this? It won't work. Infact, can you please just give us a working file?

Please, add the makefiles!

[Feature Request] Documentation

Add a documentation for creating sorts.

This app is incomplete.

Even after I installled all of the dependencies, there were multiple bugs remaining.

In file included from ../gfx/gfx_main.h:9:0,
                 from mode_visualizer.cpp:4:
../gfx/gfx_common.h: In member function ‘vertexVector mat4::operator*(vertexVector&)’:
../gfx/gfx_common.h:53:8: error: no match for ‘operator+=’ (operand types are ‘vertexVector’ and ‘glm::detail::tmat4x4<float>::col_type {aka glm::detail::tvec4<float>}’)
    tmp += (*this) * v;
    ~~~~^~~~~~~~~~~~~~
In file included from ../fwk/fwk.h:4:0,
                 from ../fwk/lists.h:3,
                 from ../fwk/fwk_control.h:2,
                 from mode_visualizer.cpp:5:
../fwk/fwk_synch.h:6:8: note: ‘TokenSystem::TokenSystem(TokenSystem&&)’ is implicitly deleted because the default definition would be ill-formed:
 struct TokenSystem {
        ^~~~~~~~~~~
../fwk/fwk_synch.h:6:8: error: use of deleted function ‘std::shared_timed_mutex::shared_timed_mutex(const std::shared_timed_mutex&)’
In file included from ../gfx/../common.h:5:0,
                 from ../gfx/gfx_main.h:8,
                 from mode_visualizer.cpp:4:
/usr/include/c++/7/shared_mutex:371:5: note: declared here
     shared_timed_mutex(const shared_timed_mutex&) = delete;
     ^~~~~~~~~~~~~~~~~~

It would be nice if you uploaded a version of this app where this wasn't an issue.

Compile? With What?

What do I use to compile the source code? I'm one of your subscribers.

Adding new mergeStrat variant

see https://github.com/ErrorDAR32/SortingVisualizer for the new variant
this variant that i called doubly (any similarity with any other merge sort in existence is purely coincidence) basically divides the merge space into 4 sublists with the help of 3 pointers those four being (in order) the sorted list, the first mergeable list, the workspace, and the second mergeable list, and compares the first items of the last 3 to en up with a merged array.

I tried to comply as much as possible with your style and requirements to integrate the merge variant, but i have probably failed miserably in some pretty stupid way, i had to port the code from python and i dont know that much c++, i also dont know how to compile your project so i couldnt test it properly, if any error can be signaled for correction would be cool, and eventually merge the variant if you like it would be cooler!

How do I use the code?

DOES SOME ONE HAVE A RELEASE

I TRIED TO COMPILE BUT IT FAILS

Request: Readme

If possible, just a README for instructions on how to compile and run this code. Potentially an executable might be helpful to those who are not experienced with c++

Very Good at Documentation

No Compile Guides.
No Releases(Already Compiled App).
Missing Files to compile for people can know compiling.

@w0rthy we will waiting you.