Skip to content
View syminical's full-sized avatar

Block or report syminical

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. NoClutter-YouTube NoClutter-YouTube Public

    Removes Youtube's intrusive "information" boxes.

    JavaScript 3 2

  2. WoWvendorMacro WoWvendorMacro Public

    A macro that buys an item from a vendor.

    Lua 1

  3. PUK PUK Public

    A Python script that decodes USB keyboard packet capture hex data.

    Python 9

  4. Tetris-Sprint Tetris-Sprint Public

    Inspired by http://www.tetrisfriends.com/games/Sprint/game.php , wanted to see if I could do it.

    Java

  5. heap_sort_tail_recursion.py heap_sort_tail_recursion.py
    1
    # 2021/11/10
    2
    
    
    3
    # Python is not the best for this, but the syntax makes it worth it.
    4
    # Set state_logging to false if you would rather see tests instead of state changes.
    5
    # heap_sort, fix_heap_up, and fix_heap_down are tail-recursive.
  6. String Permutations - Tail Recursion... String Permutations - Tail Recursion - Algorithms to generate all possible permutations of a given string. Why aren't "curried string trees" a thing? I tried my best to stick with tail-recursion, but Python didn't like it.
    1
    # This was my idea before starting to code:
    2
    #[c, a, t]
    3
        #[a, t]
    4
            #[t, a]
    5
    #[(c, [(a, [(t, [])]), (t, [(a, [])])]), (a, [(c, [(t, [])]), (t, [(c, [])])]),...]