TAILIEUCHUNG - HandBooks Professional Java-C-Scrip-SQL part 134

Tham khảo tài liệu 'handbooks professional java-c-scrip-sql part 134', công nghệ thông tin, kỹ thuật lập trình phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | 1. Make only one pass through the data for each character position rather than two as at present 2. Add the ability to handle integer or floating-point data rather than character data 3. Add the ability to handle variable-length strings as keys You can find suggested approaches to problems in Chapter . Footnotes 1. 250 blocks of 1000 records at 16 bytes of overhead per block yields an overhead of 250 16 or 4000 bytes. 2. A description of this sort can be found in Donald Knuth sKnuth Donald E. book The Art of Computer Programming vol. 3. Reading Massachusetts Addison-Wesley 1968. Every programmer should be aware of this book since it describes a great number of generally applicable algorithms. As I write this a new edition of this classic work on algorithms is about to be published. 3. However distribution counting is not suitable for use where the data will be kept in virtual memory. See my article Galloping Algorithms in Windows Tech Journal 2 February 1993 40-43 for details on this limitation. 4. As is standard in C and C library implementations this version of qsort requires the user to supply the address of a function that will compare the items to be sorted. While this additional overhead biases the comparison slightly against qsort this small disadvantage is not of the same order of magnitude as the difference in inherent efficiency of the two algorithms. 5. Of course we could just as well have used the keys that start with any other character. 6. There are some situations where this is not strictly true. For example suppose we want to read a large fraction of the records in a file in physical order and the records are only a few hundred bytes or less. In that case it is almost certainly faster to read them all with a big buffer and skip the ones we aren t interested in. The gain from reading large chunks of data at once is likely to outweigh the time lost in reading some unwanted records. 7. Please note that there is a capacity constraint in this

• Kỹ thuật lập trình
• Thủ thuật lập trình
• hướng dẫn lập trình
• tài liệu lập trình
• học lập trình
• Java C Scrip SQL
• kỹ thuật lập trình
• kỹ năng lập trình
• bí quyết lập trình
• phương pháp lập trình
• tư liệu lập trình
• kĩ thuật lập trình
• kĩ năng lập trình
• AutoIT