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.
Merge sortSamplesortQuicksortSelection sortSuffix arrayBucket sortRadix sortInsertion sortSmoothsortBitonic sorterSchwartzian transformHeapsortSimhashGnome sortExternal sortingCubesortTimsortContraction hierarchiesBurrows-wheeler transformJump searchLoop splittingCache placement policiesBzip2Column generationBit arrayString substitutionBitap algorithmGeneralized suffix treeC string handlingArithmetic codingQsortCachefsHash listCacheCompressDynamic perfect hashingData deduplicationSearchable symmetric encryptionLeast frequently usedDepth-first searchDisjoint setFast fourier transformQuickselectCache invalidationChudnovsky algorithmJump point searchArray programmingBcachefsBlock cipherInlinerCpu cacheDynamic programmingOptimizerAlgorithmSearch treeLr parserLookup tablePredictive parserFibonacci heapHash functionTreiber stackConstant foldingCache hierarchySchoof's algorithmBitwise operations in cShunting-yard algorithmSort-merge joinFibonacci codingKernelizationInternet cache protocolBreadth-first searchTsortCopy elisionCompressorTime series databaseOpen addressingIndexConcurrent data structureAdaptive huffman codingData-oriented designPatience sortingTrieSequential access memorySearch engine indexingString interningMultilevel feedback queueConstrained shortest path firstHash array mapped trieBulk synchronous parallelMemcachedElasticsearchComprehensionData structureHash tableSma*Adaptive replacement cacheImage compressionBytecodeClustalB-tree