Algorithm Visualizer
an invention by agraul
Updated almost 3 years ago. 1 hackers ♥️. 1 follower.

Project Description

This project is about creating a GUI that visualizes algorithms. At first, it will focus on search and sort algorithms.

Goal for this Hackweek

Have a GUI that shows a bubble-sort.

Results

I wrote a small program that shows quick sort and bubble sort. Each number is represented by a bar with a length that's proportional to its value and a color based on its initial position in the array. The coloring helps tracking individual numbers.

After recording the demo you can see on the repository page, I refactored the code to allow multiple arrays at the same time. That allows for direct comparisons, but needs to be improved to control them at once.

Repo: https://git.sr.ht/~agraul/visu (mirrored to https://github.com/agraul/visu)

Resources

  • https://lib.rs/crates/egui
  • https://github.com/emilk/eframe_template/

Looking for hackers with the skills:

rust algorithms gui

This project is part of:

Hack Week 22

Activity

  • almost 3 years ago: agraul added keyword "algorithms" to this project.
  • almost 3 years ago: agraul added keyword "gui" to this project.
  • almost 3 years ago: agraul added keyword "rust" to this project.
  • almost 3 years ago: hennevogel liked this project.
  • almost 3 years ago: agraul started this project.
  • almost 3 years ago: agraul originated this project.


    • Comments

    Be the first to comment!

    Similar Projects

    Modal editor in Rust by acervesato

    Description

    To write a modal editor in Rust inspired by vim and having the following features:

    • vim basic motion commands + insert/visual mode
    • multiple buffers with tabs
    • status bar

    It should be written for terminal only using ratatui library and crossterm.

    Goals

    The goal is to start with a functional prototype that can be extended in the future with the following features (in random order):

    • treesitter support + styles
    • fuzzy finder
    • grep finder
    • integration with git
    • tree viewer
    • internal terminal floating window
    • mailing list workflow integration

    Resources

    RMT.rs: High-Performance Registration Path for RMT using Rust by gbasso

    Description

    The SUSE Repository Mirroring Tool (RMT) is a critical component for managing software updates and subscriptions, especially for our Public Cloud Team (PCT). In a cloud environment, hundreds or even thousands of new SUSE instances (VPS/EC2) can be provisioned simultaneously. Each new instance attempts to register against an RMT server, creating a "thundering herd" scenario.

    We have observed that the current RMT server, written in Ruby, faces performance issues under this high-concurrency registration load. This can lead to request overhead, slow registration times, and outright registration failures, delaying the readiness of new cloud instances.

    This Hackweek project aims to explore a solution by re-implementing the performance-critical registration path in Rust. The goal is to leverage Rust's high performance, memory safety, and first-class concurrency handling to create an alternative registration endpoint that is fast, reliable, and can gracefully manage massive, simultaneous request spikes.

    The new Rust module will be integrated into the existing RMT Ruby application, allowing us to directly compare the performance of both implementations.

    Goals

    The primary objective is to build and benchmark a high-performance Rust-based alternative for the RMT server registration endpoint.

    Key goals for the week:

    1. Analyze & Identify: Dive into the SUSE/rmt Ruby codebase to identify and map out the exact critical path for server registration (e.g., controllers, services, database interactions).
    2. Develop in Rust: Implement a functionally equivalent version of this registration logic in Rust.
    3. Integrate: Explore and implement a method for Ruby/Rust integration to "hot-wire" the new Rust module into the RMT application. This may involve using FFI, or libraries like rb-sys or magnus.
    4. Benchmark: Create a benchmarking script (e.g., using k6, ab, or a custom tool) that simulates the high-concurrency registration load from thousands of clients.
    5. Compare & Present: Conduct a comparative performance analysis (requests per second, latency, success/error rates, CPU/memory usage) between the original Ruby path and the new Rust path. The deliverable will be this data and a summary of the findings.

    Resources

    • RMT Source Code (Ruby):
      • https://github.com/SUSE/rmt
    • RMT Documentation:
      • https://documentation.suse.com/sles/15-SP7/html/SLES-all/book-rmt.html
    • Tooling & Stacks:
      • RMT/Ruby development environment (for running the base RMT)
      • Rust development environment (rustup, cargo)
    • Potential Integration Libraries:
      • rb-sys: https://github.com/oxidize-rb/rb-sys
      • Magnus: https://github.com/matsadler/magnus
    • Benchmarking Tools:
      • k6 (https://k6.io/)
      • ab (ApacheBench)