An algorithm complexity, or its efficiency, meaning its time of evaluation is the focus of primary care in algorithmic problems solving. Raising the used memory may reduce the complexity of algorithm drastically. We present an example of two algorithms on finite set, where change the approach to the same problem and introduction a memory array allows decrease the complexity of the algorithm from the order O(n2) up to the order O(n).
展开▼
机译:LTE通讯系统中针对同层干扰环境对微小型基地台功率控制与用户位置推荐演算法 =Femtocell Power Control and User Location Recommendation Algorithm for Co-Tier Interference Environment in LTE Communication System