Message from JavaScript discussions

May 2017

— For "Hello", it checks for this type of path in the set:

H: {
5: {
// Word may exist in here


So as you can probably tell, construction of the set dictates where in the set we conduct the search

— Of course if you have a set with only words which start with H, and are of all the same length, it will be only as effective as a linear search on a flat array

Message permanent page

— But for diverse datasets, this will improve search efficiency massively

— You could also target by multiple letters, instead of just the first. I'm not sure how much more effective that would be

Message permanent page

— All these checks are ordered from "least expensive" to "most expensive" too, so if we can deduce that the string is not in the set from a less expensive method, we just saved time :D

Message permanent page

— Put in js file, and module.exports the class

— Should follow this api:
s = new Set()

— Sure

— Made the test better

— I am eager to see if it is slower or faster

— As the dataset diversifies the algorithm will slow down, of course, but I am wondering about overall speed average

Message permanent page