Amdahl’s Law
estimates the upper limit of theoretical speedup due to limited parallelizable parts.
View formula explanation← All subjects COMPUTER SCIENCE Computer Science Computer Science Computer Science Computer Science
Computer ScienceFormulas
has been included 4, including variable description, usage conditions and reference materials.
found 4formulas · currently displayed 4Articles Explanation · Unit · Applicable conditions
binary search complexity
halve the ordered search range each time, and the number of iterations is logarithmic.
View formula explanationEquilibrium situation of the main divide and conquer theorem
gives the asymptotic complexity of the subproblem balanced with the cost of merging.
View formula explanationSoftmax normalization
maps real scores to a distribution of positive values summing to 1.
View formula explanationContinue learning
Reference: MIT OpenCourseWare · Introduction to Algorithms ↗
source link is for extended learning; the instructions on this site are independently compiled, please check the specific model with the original data.