Quasimodo contains 35 result(s) for your request.

Subject Predicate Object Modality Polarity Plausibility Neighborhood Sigma Local Sigma Inspect
binary search be called binary POSITIVE 0.8575 0.8575 1.0000
binary search be better than ternary search POSITIVE 0.7724 0.7724 1.0000
binary search be better than linear POSITIVE 0.7358 0.7358 1.0000
binary search be n log POSITIVE 0.6994 0.6994 1.0000
binary search has_property yes POSITIVE 0.6241 0.6241 0.6241
binary search has_trait efficient POSITIVE 0.5987 0.5987 0.5987
binary search has_trait helpful POSITIVE 0.5237 0.5237 0.5237
binary search has_property zero calculated POSITIVE 0.5173 0.5173 0.5632
binary search has_property zero rated POSITIVE 0.5101 0.5101 0.5101
binary search be faster than linear POSITIVE 0.3926 0.3926 1.0000
binary search has_property history POSITIVE 0.3538 0.3538 0.3538
binary search give benefit over linear search POSITIVE 0.3463 0.3463 1.0000
binary search has_property zero POSITIVE 0.3324 0.3324 0.3324
binary search be better than linear search POSITIVE 0.1468 0.1468 1.0000
binary search be different from linear search POSITIVE 0.1209 0.1209 1.0000
binary search be faster than sequential search POSITIVE 0.0178 0.0178 1.0000
binary search be in o algorithm POSITIVE 0.0147 0.0147 1.0000
binary search has_property o algorithm POSITIVE 0.0143 0.0143 1.0000
binary search give example some[subj/you do] POSITIVE 0.0139 0.0139 0.0387
binary search has_property log n POSITIVE 0.0121 0.0121 0.4843