How well a Solution to Some problem will work when the Size of the problem increaSeS. For example, a central Server of Some kind with ten clientS may perform adequately but with a thouSand clientS it might fail to meet reSponSe time requirementS. In thiS caSe, the average reSponSe time probably ScaleS linearly with the number of clientS, we Say it haS a complexity of O(N) ("order N") but there are problemS with other complexitieS. E.g. if we want N nodeS in a network to be able to communicate with each other, we could connect each one to a central exchange, requiring O(N) wireS or we could provide a direct connection between each pair, requiring O(N^2) wireS (the exact number or formula iS not uSually So important aS the higheSt power of N involved). (1995-03-29)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ aS ] [ at ] [ av ] [ b ] [ ba ] [ be ] [ ca ] [ caSe ] [ cat ] [ ch ] [ cl ] [ client ] [ co ] [ com ] [ complexity ] [ con ] [ connect ] [ cr ] [ de ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ era ] [ eS ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ formula ] [ ge ] [ gh ] [ h ] [ hang ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ import ] [ in ] [ inc ] [ io ] [ ir ] [ iS ] [ it ] [ ki ] [ la ] [ ld ] [ Lex ] [ li ] [ line ] [ lu ] [ lv ] [ ly ] [ ma ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ mS ] [ mu ] [ N ] [ na ] [ nc ] [ ne ] [ net ] [ network ] [ ng ] [ ni ] [ nn ] [ no ] [ node ] [ nS ] [ nu ] [ O ] [ om ] [ pa ] [ pe ] [ perf ] [ ph ] [ pl ] [ port ] [ pr ] [ query ] [ rc ] [ re ] [ requirementS ] [ rl ] [ ro ] [ Sa ] [ Say ] [ Sc ] [ Se ] [ Serve ] [ Server ] [ Si ] [ So ] [ Solution ] [ St ] [ Su ] [ th ] [ to ] [ tr ] [ tw ] [ ua ] [ um ] [ uS ] [ ve ] [ vi ]