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 sortCounting sortBucket sortSamplesortReduction operatorFractional cascadingContraction hierarchiesAlgorithmic efficiencyQuickselectSkip listAppendShunting yard algorithmArray slicingIteratorCode refactoringDynamic perfect hashingSearch algorithmData transformationFunctional programmingInstruction schedulingLookup tableControl flow analysisLibrary sortHash listB-treeData structureList decodingSorted arrayProgram optimizationK-way merge algorithmHirschberg's algorithmSearch data structureList comprehensionTree sortArray programmingMatching wildcardsCopy elisionInput enhancementLinked listSearch treeQsortSeparation of concernsTsortIntrosortCoinductionSubroutineSort-merge joinHash tablePatience sortingTree shakingLocality-sensitive hashingMerge algorithmGeneratorDoubly linked listData deduplicationPackage principlesLoop nest optimizationShift-reduce parserCompare-and-swapListStrategy patternInterprocedural optimizationRule-based systemBinary translationBinary decision diagramIterator patternSyntactic sugarRegister renamingFunction compositionShadow memoryPriority queueFibonacci heapCall stackPermutation boxData-oriented designFormal specificationFractal tree indexGnome sortCritical path methodPreprocessorPartial evaluationSoftware design patternAlphabetical orderDiffSingle program, multiple dataStack-oriented programmingParallel algorithmObject compositionSeparation logicPriority inheritanceFor loopHash treePseudocodeReference countingBitwise operationPrefetchingIndirectionData modelingTimsortSolid compression