Skip to content
View vmthanh-bi's full-sized avatar

Block or report vmthanh-bi

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
vmthanh-bi/README.md

1 2 3 4 5

Welcome | Witaj | Chào Mừng | Bienvenu | Bienvenidos

My name is Tony Vu, a passionate web & iOS developer from Warsaw, Poland.

Check out what I have been working on!
https://github.com/vmthanh-bi/100DaysOfSwiftUI

Find me on
Ask me anything - reach me at vmthanh.bi@gmail.com
I’m looking to collaborate on anything free and open source!

More about: Tony Vu 

struct TonyVu {
    var nationality = ["Polish", "Vietnamese"]
    var operatingSystem = "macOS"
    var codeLanguage = ["Swift", "Javascript", "C++", "HTML", "CSS", "R", "SQL"]
    var tools = ["SwiftUI", "MySQL"]
    var language = ["English ": "🇺🇸🏴󠁧󠁢󠁥󠁮󠁧󠁿", "Polish": "🇵🇱", "Vietnamese": "🇻🇳", "French": "🇫🇷", "Spanish": "🇪🇸"],
    var location = "Warsaw": "Poland  🇵🇱",
    var background = ["Team player": "🕺🏻🕺🏻", "Learner": "🧑🏻‍🎓", "Critical thinker": "💭", "Time manager": "⏳", "Communicator": "💬", "Problem solver": "🛠️"],
    var currentFocus = "iOS Mobile App Development"
};

Pinned Loading

  1. 100DaysOfSwiftUI 100DaysOfSwiftUI Public

    This repository is dedicated to documenting my progress of the Hacking With Swift's course "100 Days of SwiftUI" by Paul Hudson.

    Swift

  2. Closest-pair-of-points Closest-pair-of-points Public

    Implementing an O(n lg n) algorithm to determine the closest pair of points in a provided set of points P in the two-dimensional plane.

    C++

  3. Fibonacci-heap Fibonacci-heap Public

    Implementing a Fibonacci heap to find the shortest path for a provided set of a graph's edges and vertices.

    C++

  4. Prim-s-Algorithm Prim-s-Algorithm Public

    Writing Prim's algorithm to find the shortest path for a given set of a graph's edges and vertices.

    C++

  5. Single-Linked-List Single-Linked-List Public

    Creating a singly-linked list without a dummy head node.

    C++

  6. Union-by-rank-Path-compression Union-by-rank-Path-compression Public

    Given a disjoint set data structure, I use two strategies - union by rank and path compression - to find the connected components of the structure's graph.

    C++