您要查找的是不是：
- Not to mention you wouldn't get the extra memory and HDD as spares you can reuse/ resell somewhere else! 更不用说你还可以把换下来的内存和硬盘用在别的地方或者卖掉。
- This paper introduces a map sort algorithm with extra memory cost, its time complexity is O(N). 本文介绍了映射式排序算法,这种算法附加一定的存储开销,时间复杂性为O(N)。
- With this technique, space on the hard drive is used to mimic the extra memory needed. 使用这种技术，硬盘驱动器上的空间被用来模拟所需的额外内存。
- Increasing this value can significantly improve fetch performance (such as during MobiLink server downloads) at the cost of extra memory allocation. 增加此值可显著提高读取性能(例如,在MobiLink服务器下载期间),但代价是需要额外的内存分配。
- Expansion port Any socket on the out side of a computer through which an additional processor, extra memory or a peripheral can be connected. 在电脑外面,用来接驳另一部处理机、额外存储器或外圈部件的任何插座。
- Your computer can usually detect whether a printer has special accessories installed, such as additional paper trays, extra memory, or a duplex unit. 您的电脑通常可以检测到一台打印机是否安装了特别附件,如额外的纸盒、额外的内存或双面打印单元。
- Expansion port: Any socket on the out side of a computer through which an additional processor, extra memory or a peripheral can be connected. 扩展口:在电脑外面，用来接驳另一部处理机、额外存储器或外圈部件的任何插座。
- Dell's reluctance to hold inventory was briefly overridden in 1989,when the company bought millions of extra memory chips in an attempt to stay ahead of an expected shortage. 在1989年，戴尔对保持库存的厌恶遭受了重大打击。当时公司购买了数以百万计的外加存储器芯片，试图在预计的供应不足时能够有一定的存货。
- Its computational algorithm and process flowcharts are given, with average searching length within 1.39(1 + 1/N) and the extra memory cost N + 1 when data arin equidistribution. 对该算法进行分析的结果表明:在被检索数据均匀分布的情况下;分档检索法的平均检索长度不超过1.;39(1+(1/N));附加存贮开销为N+1。
- Dell's reluctance to hold inventory was briefly overridden in 1989, when the company bought millions of extra memory chips in an attempt to stay ahead of an expected shortage. 在1989年，戴尔对保持库存的厌恶遭受了重大打击。 当时公司购买了数以百万计的外加存储器芯片，试图在预计的供应不足时能够有一定的存货。
- Its process flowcharts and experimental results in BASIC and PASCAL are given. Its time complexity is O(N) and the extra memory cost is 2N + 2(N is the quantity of the data) when the data are in equidistribution. 给出排序算法、流程图和用BASIC及PASCAL语言编写程序进行实验的结果,算法分析和实验结果都表明在被排数据均匀分布的情况下,该排序方法的时间复杂性为O(N),附加存贮开销为2N+2(N为数据量),并且该排序方法在速度上明显快于QUICK SORT法。
- The terrible scene was engraved on his memory. 那可怕的情景铭记在他的记忆里。
- My extra earnings came in very handy. 我的额外收入可备我不时之需。
- This extra strong glue should do the job nicely. 这种超强度胶应该管用。
- I can't vouch for the accuracy of my memory. 我无法保证我的记忆正确无误。
- She decided to rent out a room to get extra income. 她为获得额外收入决定租出一个房间。
- She's always saddling extra duties on me. 她总是把额外责任加到我身上。
- The brackets want an extra screw. 托架需要再加一个螺钉。
- He paid the extra cost without a murmur. 他付了额外的费用而毫无怨言。
- He tied a string on his finger to jog his memory. 他把一条细绳系在指头上，以唤起记忆。
