MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
HeapPagodaTreeLeftist treeRange treeSearch treeTrieDoubly linked listHeapsortHash tableAa treeCall stackInterval treeFinger treeData structureDynamic perfect hashingBucket listBinary decision diagramLinked listK-d-b-treeGeneralized suffix treeFenwick treeGistMerge sortHash array mapped trieFibonacci codingMultilevel feedback queueIterator patternHash listT-treeDistributed hash tableDepth-first searchRandom forestRed-black treeFunctional programmingMemory mapJump searchBucket sortThread poolQuicksortK-d treeInsertion sortRopeHierarchical database modelSuffix arrayBreadth-first searchDisjoint setIteratorFree listMinheapMerkle treeAssociative containersAvl treeGraph databaseDataflow programmingM-treePurely functional data structureLcp arrayNestNodeJava collections frameworkHierarchical databaseRecordSelection sortLevel setHigher-order abstract syntaxAppendConcurrent hash tableStack-oriented programmingHypercube internetwork topologyFor loopContainerData clusterPrimitive data typeAssociative arraySentinel nodeNode graph architectureHierarchical control systemConcurrent data structureLinear hashingContraction hierarchiesDirectoryArray programmingSamplesortBucketRadix sortTupleFirst in first outAbstract data typeHypercubeStackComputer architectureTimsortJudy arrayQuadtreeSchwartzian transformFile systemTuple spaceCache hierarchyGang scheduling