satbit007 Goto Github PK

bookish-guide

closest-pair

The problem is to find out the closest pair of points in an array of n points in a plane. This problem arises in a number of applications. For example, in air-traffic control, you may want to monitor planes that come too close together, since this may indicate a possible collision.

dino-game

machine-learning-driven-approach-to-automated-essay-scoring-aes-

nus_gaip

practice-repo

CS-1203-Data-Structures

satbit007

Config files for my GitHub profile.

string-based-trie-of-suffix-tries

Generating auto-correction suggestions using keyboard user-input by traversing the suffix trie based on the user input data so far and offering the most-likely string outcome based on a simplistic counter mechanism to track the user’s most used paths taken based on that scenario (similarly to a fusion tree)