您要查找的是不是：
- 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. 他把一條細繩系在指頭上，以喚起記憶。
