Assertion: algorithm | /r/CapableOf | depend characteristic i. example
Facets:
value: on instance
type: LOCATION
Source sentences:
text: Therefore Space complexity of any algorithm P is , where C is the fixed part and S(I) is the variable part of the algorithm, which depends on instance characteristic I. Example
text: Therefore Time complexity of any algorithm P is , where C is the constant time part and TP(I) is the variable part of the algorithm, which depends on instance characteristic I. Example: