Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
use in-order traversal to create a sort routine what time complexity does it have under what conditions might it behave
write a generic list type for c the easiest way is to have each list item hold a voids that points to the data do the
implement the necessary changes to addname and del name to delete items by marking deleted items as unused how isolated
what are some input sequences that might cause a quicksort implementation to display worst-case behavior try to find
design and implement an algorithm that will sort an array of n integers as slowly as possible you have to play fair the
quicksort is most naturally expressed recursively write it iteratively and compare the two versions hoare describes how
design and implement a library for creating csv-formatted data the simplest version might take an array of strings and
we chose to use the static initialization provided by c as the basis of a one-time switch if a pointer is null on entry
write a c version that uses only classes and the string data type but no other advanced library facilities compare it
the great strength of the stl is the ease with which one can experiment with different data structures modify the c
remove the statements that place sentinel nonwords at the beginning and end of the data and modify generate so it
if each input word is stored in a second hash table the text is only stored once which should save space measure some
design and implement a version of f req that measures the frequencies of other types of data values such as 32-bit
specify a testing regime for numerical routines like sqrt sin and so on as found in math h what input values make sense
define mechanisms for testing the functions of the c str family like strcmp some of these functions especially
a table that maps a single character to the set of patterns that begin with that character gives an order of magnitude
whether or not your system has a time comnand use clock or gettime to write a timing facility for your own use compare
one way to make a function like memset run faster is to have it write in word-sized chunks instead of byte-sized this
write a memory allocator smalloc for c strings that uses a specialpurpose allocator for small strings but calls ma1 1
create a set of tests for estimating the costs of basic operations for computers and compilers near you and investigate
create a cost model for higher-level operations in c among the features that might be included are construction copying
write a program to remove spurious carriage returns from a file write a second program to add them by replacing each
add some options to grep popular ones include -v to invert the sense of the match -i to do case-insensitive matching of
modify match and grep to work with utf-8 strings of unicode characters because utf-8 and unicode are a superset of
exercise 7-7 involved writing a program to measure the cost of various operations in c use the ideas of this section to