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.
Binary searchFibonacci search techniqueCounting sortB-treeBinary search treeBucket sortInterpolation searchFractional cascadingRange minimum queryBinary space partitioningTrieTernary searchOptimal binary search treeMin-max heapString-searching algorithmTree sortRange searchingSelection algorithmSearch algorithmSelection sortSegment treeArray data structureSearch data structureExponential searchSorted arrayRadix sortBeam searchBidirectional searchDepth-first searchSearch problemLongest increasing subsequenceBinary gcd algorithmFractal tree indexSelf-balancing binary search treeBitwise operationRoot-finding algorithmsIndex mappingCartesian treeSkip listTree traversalTreapArray slicingHirschberg's algorithmKadane's algorithmApproximate string matchingReduction operatorMaximum subarray problemCycle detectionBrute-force searchBubble sortLinked listBacktracking line searchShellsortAlgorithmAvl treeIndex calculus algorithmInverse quadratic interpolationGeometric hashingShunting yard algorithmCubesortLine searchTernary search treeState space searchLinear probingDisjoint-set data structureBinary treeMedian of mediansBoolean data typeGraph traversalArray data typeHalley's methodBinary numeral systemKarger's algorithmInverse iterationBinomial heapIndex notationGradient descentSuccessive-approximation adcAnalysis of algorithmsMonte carlo tree searchRandom binary treePolynomial long divisionLibrary sortBinary-coded decimalSieve of sundaramBreadth-first searchKosaraju's algorithmRadix treeClenshaw algorithmBiconjugate gradient methodMergesortMinhashPythagorean additionAnalysis of parallel algorithmsBlock sortLinear interpolationPivotSecant methodDynamic programmingEuclidean algorithm