albertng123's repositories
algorithms
A documentation for my algorithms learning
AnyChart-Android
AnyChart Android Chart is an amazing data visualization library for easily creating interactive charts in Android apps. It runs on API 19+ (Android 4.4) and features dozens of built-in chart types.
bootstrap-4.0.0
Open raw and send it into https://gitcdn.link/
english_words
Utilities for working with English words
Hacktoberfest2019-Topcoder
Repository untuk Booth Topcoder di Hacktoberfest 2019 Medan
Hacktoberfest2020
Make your first Pull Request and earn a free tee from GitHub!
lyricGenerator
A lyric generator made using Scrapy, Keras, and python for sure
Modified-Cheapest-Insertion-Heuristic
Arranging the sequence of places to visit is the common problem that tourists or foreigners encountered when visiting a new site, especially for foreigners that visit Medan City. This kind of case similar to Traveling Salesman Problem cases. Therefore we could use one of the modified TSP algorithm to solve it, which is Modified Cheapest Insertion Heuristics. The Modified Cheapest Insertion is a method to insert the cheapest weight starting from 2 points of place until all of the sites are being connected from the starting point until the endpoint. The strength of Modified Cheapest Insertion Heuristics is the calculation will remain stable even for a large number of inputs. In this research, all of the desired-to-visit places are being connected as a route. Arranging the sequence of places to visit is the common problem that tourists or foreigners encountered when visiting a new site, especially for foreigners that visit Medan City. This kind of case similar to Traveling Salesman Problem cases. Therefore we could use one of the modified TSP algorithm to solve it, which is Modified Cheapest Insertion Heuristics. The Modified Cheapest Insertion is a method to insert the cheapest weight starting from 2 points of place until all of the sites are being connected from the starting point until the endpoint. The strength of Modified Cheapest Insertion Heuristics is the calculation will remain stable even for a large number of inputs. In this research, all of the desired-to-visit places are being connected as a route.
My_FirstFlutter
My First Time Using Flutter
thank-you-github
An open letter of gratitude to GitHub