Computer Science: A Structured Programming Approach Using CBrooks/Cole, 2001 - 900 Seiten The Second Edition of this useful book presents both computer science theory and C-language syntax with a principle-before-implementation approach. Forouzan and Gilberg continue to present a clear organizational structure, supplemented by easy-to-follow figures, charts, and tables. Always readable, the book develops programs and functions consistently and clearly, based on the authors' extensive academic and industry experience. The first half of the book builds a firm understanding of expressions, including pointers only to the extent necessary to cover pass-by-reference and arrays. |
Im Buch
Ergebnisse 1-3 von 19
Seite 269
... RECURSIVE DEFINITION A repetitive function is defined recursively whenever the function appears within the definition itself . For example , the factorial function can be defined recursively , as shown in Formula 2 . if n = 0 factorial ...
... RECURSIVE DEFINITION A repetitive function is defined recursively whenever the function appears within the definition itself . For example , the factorial function can be defined recursively , as shown in Formula 2 . if n = 0 factorial ...
Seite 270
... RECURSIVE FUNCTIONS 13 } / * factorial * / Program 6-25 Recursive factorial In the recursive version , we let the function factorial call itself , each time with a different set of parameters . Figure 6-27 shows this mechanism with the ...
... RECURSIVE FUNCTIONS 13 } / * factorial * / Program 6-25 Recursive factorial In the recursive version , we let the function factorial call itself , each time with a different set of parameters . Figure 6-27 shows this mechanism with the ...
Seite 275
... recursion works . To understand how it works , you will need to study data structures and concepts that are beyond the scope of this text . On the other hand , you do need to understand the two major limitations of recursion . First , ...
... recursion works . To understand how it works , you will need to study data structures and concepts that are beyond the scope of this text . On the other hand , you do need to understand the two major limitations of recursion . First , ...
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
address operator algorithm Analysis array assignment binary file bytes calculate called function calloc char compile error concept constant contains create data structure data type define delete digit element elevator end of file enter enumerated type example expression false fgets float floating-point format string FRACTION fseek ftell getData include stdio.h initialize insert insertion sort int main void integer keyboard language linked list logic loop master file memory Morse code newline node null character operand output parameter pass pCur pList pointer pPre printf printf("Enter Prototype Declarations pseudocode pwalker random number result scanf score selection sort shown in Figure shown in Program simple sizeof sort stored strcat strcmp strcpy strtol structure chart structured programming student Table text file typedef struct update valid variable whitespace Write a function Write a program zero