Skip to content
View vicsstar's full-sized avatar

Block or report vicsstar

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
vicsstar/README.md
  • 👋 Hi, I’m Victor Igbokwe, a Full-stack Software Engineer.
  • 👀 I’m interested in Web Development, Mobile Development (with Flutter), Server-side Development (with Scala/NodeJS) and OpenSource.
  • 🌱 I’m always learning new things - whatever necessary to keep my skills evergreen and to get the job done.
  • 💞️ I’m looking to collaborate on Mobile and Web Development and other JavaScript/Dart/Scala projects - OpenSource or Commercial projects.
  • 📫 How to reach me: available on Twitter @vicsstar and via email @ vicsstar@yahoo.com

Pinned Loading

  1. FLAMES game, written in JavaScript -... FLAMES game, written in JavaScript - I liked the logic behind the game and wanted to represent it in code
    1
    // flames.js
    2
    // FLAMES game. Algorithm can be found here: http://flamesgame.appspot.com/algorithm
    3
    
                  
    4
    const getFlame = (name1, name2) =>
    5
      name1.toLowerCase().split('').                                                      // take all characters in "name1", to compare
  2. Implementation of a simple Tree data... Implementation of a simple Tree data structure - tested with the common DOM structure
    1
    function createNode(key) {
    2
      const children = [];
    3
      const attributes = {};
    4
    
                  
    5
      return {
  3. Simple QuickSort functions without s... Simple QuickSort functions without side-effects in JavaScript and Scala #just-for-fun The tricks to make it "stateless", makes it slower - the algorithm becomes useless, almost, in the context of "quick sort" for large to really large lists. Little optimisation (with filtering & zipping). Then again, it's just for fun....
    1
    object QuickSort {
    2
      def sort(list: Seq[Int]): Seq[Int] = {
    3
        if (list.length < 2) list
    4
        else {
    5
          val midIndex = list.length / 2
  4. data-structures data-structures Public

    My implementations of data structures I'm learning or have learned about

    Java