Learn to Program with C_ Learn to Program using the Popular C Programming Language ( PDFDrive )

Recommendations

Info

Chapter 9 ■ Searching, Sorting, and Mergingthose 1thoughts 1treat 1triumph 1two 1unforgivin 1with 2worth 1you 4your 2yours 1Comments on Program P9.4• For our purposes, we assume that a word begins with a letter and consistsof letters only. If you want to include other characters (such as a hyphen orapostrophe), you need change only the getWord function.• MaxWords denotes the maximum number of distinct words catered for. Fortesting the program, we have used 50 for this value. If the number of distinctwords in the passage exceeds MaxWords (50, say), any words after the 50thwill be read but not stored, and a message to that effect will be printed.However, the count for a word already stored will be incremented if it isencountered again.• MaxLength (we use 10 for testing) denotes the maximum length of a word.Strings are declared using MaxLength+1 (defined as MaxWordBuffer) to caterfor \0, which must be added at the end of each string.• main checks that the input file exists and that the output file can be created.Next, it initializes the frequency counts to 0. It then processes the words inthe passage based on the outline shown at the beginning of this Section.• getWord reads the input file and stores the next word found in its stringargument. It returns 1 if a word is found and 0, otherwise. If a word is longerthan MaxLength, only the first MaxLength letters are stored; the rest are readand discarded. For example, unforgiving is truncated to unforgivin usinga word size of 10.• All words are converted to lowercase so that, for instance, The and the arecounted as the same word.• We wrote binarySearch so that if the word is found, its location (loc, say) isreturned. If not found, the location in which the word should be inserted isreturned. The test• if (strcmp(word, wordList[loc]) == 0)270www.it-ebooks.info
Chapter 9 ■ Searching, Sorting, and Merging• determines whether it was found. addToList is given the location in whichto insert a new word. Words to the right of, and including, this location areshifted to make room for the new word.• In declaring a function prototype, some compilers allow a two-dimensionalarray parameter to be declared as in char [][], with no size specified foreither dimension. Others require that the size of the second dimension mustbe specified. Specifying the size of the second dimension should work onall compilers. In our program, we specify the second dimension using theparameter max, whose value will be supplied when the function is called.9.8 Merge Sorted ListsMerging is the process by which two or more ordered lists are combined into one ordered list. Forexample, given two lists of numbers, A and B, as follows:A: 21 28 35 40 61 75B: 16 25 47 54They can be combined into one ordered list, C, as follows:C: 16 21 25 28 35 40 47 54 61 75The list C contains all the numbers from lists A and B. How can the merge be performed?One way to think about it is to imagine that the numbers in the given lists are stored on cards,one per card, and the cards are placed face up on a table, with the smallest at the top. We canimagine the lists A and B as follows:21 1628 2535 4740 546175We look at the top two cards, 21 and 16. The smaller, 16, is removed and placed in C. This exposesthe number 25. We have this:21 2528 4735 54406175271www.it-ebooks.info
Page 1 and 2:
THE EXPERT’S VOICE® IN PROGRAMMI
Page 3 and 4:
Learn to Program with CCopyright ©
Page 5 and 6:
Contents at a GlanceAbout the Autho
Page 7 and 8:
■ Contents1.7 Write Output with p
Page 9 and 10:
■ Contents■Chapter ■ 5: Progr
Page 11 and 12:
■ Contentsxii7.11 Some Character
Page 13 and 14:
About the AuthorDr. Noel Kalicharan
Page 15 and 16:
AcknowledgementsI would like to exp
Page 17 and 18:
■ PrefaceOf course, you must lear
Page 19 and 20:
Chapter 1 ■ Elementary Programmin
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Chapter 2C - The BasicsIn this chap
Page 41 and 42:
Chapter 2 ■ C - The Basicstokenin
Page 43 and 44:
2.3.2 Reserved WordsChapter 2 ■ C
Page 45 and 46:
2.5 Integer Numbers - intChapter 2
Page 47 and 48:
Chapter 2 ■ C - The Basicsis eval
Page 49 and 50:
Chapter 2 ■ C - The BasicsEach nu
Page 51 and 52:
Chapter 2 ■ C - The Basics6 says
Page 53 and 54:
Chapter 2 ■ C - The BasicsIf op1
Page 55 and 56:
Chapter 2 ■ C - The BasicsThe val
Page 57 and 58:
2.8 The Assignment StatementChapter
Page 59 and 60:
Chapter 2 ■ C - The BasicsExercis
Page 61 and 62:
Chapter 2 ■ C - The Basics30. Wha
Page 63 and 64:
Chapter 3 ■ Programs with Sequenc
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Chapter 4Programs with Selection Lo
Page 81 and 82:
Chapter 4 ■ Programs with Selecti
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Chapter 5 ■ Programs with Repetit
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Chapter 6 ■ CharactersThe ASCII c
Page 157 and 158:
Chapter 6 ■ CharactersIn this cas
Page 159 and 160:
Chapter 6 ■ CharactersHThis would
Page 161 and 162:
Chapter 6 ■ CharactersProgram P6.
Page 163 and 164:
Chapter 6 ■ Characters6. The whil
Page 165 and 166:
Chapter 6 ■ Characters6.6 Count C
Page 167 and 168:
Chapter 6 ■ Charactersnumber of c
Page 169 and 170:
Chapter 6 ■ Characters6.9 Read Ch
Page 171 and 172:
Chapter 6 ■ CharactersThis proble
Page 173 and 174:
Chapter 6 ■ CharactersTo get arou
Page 175 and 176:
Chapter 6 ■ CharactersThe sequenc
Page 177 and 178:
Chapter 6 ■ Characters11. Write a
Page 179 and 180:
Chapter 7 ■ Functions7.2 skipLine
Page 181 and 182:
Chapter 7 ■ FunctionsWhen we wish
Page 183 and 184:
Chapter 7 ■ FunctionsIf, when a f
Page 185 and 186:
Chapter 7 ■ FunctionsIn order to
Page 187 and 188:
Chapter 7 ■ Functionsessentially
Page 189 and 190:
Chapter 7 ■ FunctionsThe logic fo
Page 191 and 192:
Chapter 7 ■ FunctionsSince lcm us
Page 193 and 194:
Chapter 7 ■ Functions• The logi
Page 195 and 196:
Chapter 7 ■ FunctionsWhen main is
Page 197 and 198:
Chapter 7 ■ Functionsint factoria
Page 199 and 200:
Chapter 7 ■ Functions7.10 Sum of
Page 201 and 202:
Chapter 7 ■ Functions7.11 Some Ch
Page 203 and 204:
Chapter 7 ■ Functionsint isLowerC
Page 205 and 206:
Chapter 7 ■ FunctionsThis fetches
Page 207 and 208:
Chapter 7 ■ Functions8. Write a f
Page 209 and 210:
Chapter 8ArraysIn this chapter, we
Page 211 and 212:
Chapter 8 ■ ArraysIn our example,
Page 213 and 214:
Chapter 8 ■ ArraysIf we wish to p
Page 215 and 216:
8.3.1 About Not Using Element 0Chap
Page 217 and 218:
Chapter 8 ■ ArraysPoints to note
Page 219 and 220:
Chapter 8 ■ ArraysThe complete pr
Page 221 and 222:
Chapter 8 ■ ArraysThis prints a l
Page 223 and 224:
Chapter 8 ■ ArraysYou can change
Page 225 and 226:
Chapter 8 ■ ArraysTo use the func
Page 227 and 228:
Chapter 8 ■ ArraysThe length of a
Page 229 and 230:
Chapter 8 ■ ArraysIn printf, the
Page 231 and 232: Chapter 8 ■ ArraysSwapping two ch
Page 233 and 234: Chapter 8 ■ ArraysIf all the lett
Page 235 and 236: Chapter 8 ■ Arraysshe does this,
Page 237 and 238: Chapter 8 ■ Arrays} //end letters
Page 239 and 240: Chapter 8 ■ ArraysFigure 8-3. The
Page 241 and 242: Chapter 8 ■ ArraysSuppose we have
Page 243 and 244: Chapter 8 ■ ArraysSuppose a count
Page 245 and 246: Chapter 8 ■ Arraysdelim = ch;whil
Page 247 and 248: Chapter 8 ■ ArraysHere is the fun
Page 249 and 250: Chapter 8 ■ ArraysBut what kind o
Page 251 and 252: Chapter 8 ■ ArraysThis is a cleve
Page 253 and 254: Chapter 8 ■ Arraysfprintf(out, "\
Page 255 and 256: Chapter 9Searching, Sorting, and Me
Page 257 and 258: Chapter 9 ■ Searching, Sorting, a
Page 271 and 272: 9.3.2 Insert an Element in PlaceCha
Page 281: Chapter 9 ■ Searching, Sorting, a
Page 291 and 292: Chapter 10 ■ StructuresThe proble
Page 293 and 294: Chapter 10 ■ StructuresFor this e
Page 295 and 296: Chapter 10 ■ StructuresSince ther
Page 297 and 298: Chapter 10 ■ Structures286Suppose
Page 299 and 300: Chapter 10 ■ StructuresWe could e
Page 301 and 302: Chapter 10 ■ Structuresint n = 0;
Page 303 and 304: Chapter 10 ■ Structures10.7 Neste
Page 305 and 306: Chapter 10 ■ Structuresint main()
Page 307 and 308: Chapter 10 ■ Structures296A file,
Page 309 and 310: Chapter 10 ■ Structureselseprint
Page 311 and 312: Chapter 10 ■ StructuresTo find th
Page 313 and 314: Chapter 10 ■ StructuresVoteCount
Page 315 and 316: Chapter 10 ■ Structureswhile (k >
Page 317 and 318: Chapter 10 ■ Structures6. A file
Page 319 and 320: ■ index• CCharactersarithmetic
Page 321 and 322: ■ index• N, ONamed constants.
Page 323: ■ indexStrings (cont.)for stateme
show all

Learn to Program with C_ Learn to Program using the Popular C Programming Language ( PDFDrive )

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?