國立虎尾科技大學 |

Introducing Algorithms in C = A Step by Step Guide to Algorithms in C /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Introducing Algorithms in C/ by Luciano Manelli.
其他題名:	A Step by Step Guide to Algorithms in C /
作者:	Manelli, Luciano.
面頁冊數:	XIII, 146 p. 70 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Programming Techniques. -
電子資源:	https://doi.org/10.1007/978-1-4842-5623-7
ISBN:	9781484256237

Introducing Algorithms in C = A Step by Step Guide to Algorithms in C /
Manelli, Luciano.

Introducing Algorithms in CA Step by Step Guide to Algorithms in C /[electronic resource] :by Luciano Manelli. - 1st ed. 2020. - XIII, 146 p. 70 illus.online resource.

1. Data Structures -- 2. Design of Algorithms -- 3. Implementation of Algorithms in C.

Study elementary and complex algorithms with clear examples and implementations in C. This book introduces data types (simple and structured) and algorithms with graphical and textual explanations. In the next sections, you’ll cover simple and complex standard algorithms with their flowcharts: everything is integrated with explanations and tables to give a step-by-step evolution of the algorithms. The main algorithms are: the sum of three or n numbers in a loop, decimal-to-binary conversion, maximum and minimum search, linear/sequential search, binary search, bubble sort, selection sort, merging of two sorted arrays, reading characters from a file, stack management, and factorial and Fibonacci sequences. The last section of Introducing Algorithms in C is devoted to the introduction of the C language and the implementation of the code, which is connected to the studied algorithms. The book is full of screenshots and illustrations showing the meaning of the code. You will: Implement algorithms in C Work with variables, constants, and primitive and structured types Use arrays, stacks, queues, graphs, trees, hash tables, records, and files Explore the design of algorithms Solve searching problems, including binary search, sorting, and bubble/selection sort Program recursive algorithms with factorial functions and Fibonacci sequences.

ISBN: 9781484256237

Standard No.: 10.1007/978-1-4842-5623-7doiSubjects--Topical Terms:

669781
Programming Techniques.

LC Class. No.: QA76.7-76.73

Dewey Class. No.: 005.13

Introducing Algorithms in C = A Step by Step Guide to Algorithms in C /
LDR:02805nam a22004095i 4500 001 1018116
003 DE-He213
005 20200629133001.0
007 cr nn 008mamaa
008 210318s2020 xxu| s |||| 0|eng d
020 $a 9781484256237 $9 978-1-4842-5623-7
024 7 $a 10.1007/978-1-4842-5623-7 $2 doi
035 $a 978-1-4842-5623-7
050 4 $a QA76.7-76.73
050 4 $a QA76.76.C65
072 7 $a UMX $2 bicssc
072 7 $a COM051010 $2 bisacsh
072 7 $a UMX $2 thema
072 7 $a UMC $2 thema
082 0 4 $a 005.13 $2 23
100 1 $a Manelli, Luciano. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1313059
245 1 0 $a Introducing Algorithms in C $h [electronic resource] : $b A Step by Step Guide to Algorithms in C / $c by Luciano Manelli.
250 $a 1st ed. 2020.
264 1 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2020.
300 $a XIII, 146 p. 70 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 1. Data Structures -- 2. Design of Algorithms -- 3. Implementation of Algorithms in C.
520 $a Study elementary and complex algorithms with clear examples and implementations in C. This book introduces data types (simple and structured) and algorithms with graphical and textual explanations. In the next sections, you’ll cover simple and complex standard algorithms with their flowcharts: everything is integrated with explanations and tables to give a step-by-step evolution of the algorithms. The main algorithms are: the sum of three or n numbers in a loop, decimal-to-binary conversion, maximum and minimum search, linear/sequential search, binary search, bubble sort, selection sort, merging of two sorted arrays, reading characters from a file, stack management, and factorial and Fibonacci sequences. The last section of Introducing Algorithms in C is devoted to the introduction of the C language and the implementation of the code, which is connected to the studied algorithms. The book is full of screenshots and illustrations showing the meaning of the code. You will: Implement algorithms in C Work with variables, constants, and primitive and structured types Use arrays, stacks, queues, graphs, trees, hash tables, records, and files Explore the design of algorithms Solve searching problems, including binary search, sorting, and bubble/selection sort Program recursive algorithms with factorial functions and Fibonacci sequences.
650 2 4 $a Programming Techniques. $3 669781
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 1 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 0 $a Computer programming. $3 527822
650 0 $a Algorithms. $3 527865
650 0 $a Programming languages (Electronic computers). $3 1127615
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9781484256220
776 0 8 $i Printed edition: $z 9781484256244
856 4 0 $u https://doi.org/10.1007/978-1-4842-5623-7
912 $a ZDB-2-CWD
912 $a ZDB-2-SXPC
950 $a Professional and Applied Computing (SpringerNature-12059)
950 $a Professional and Applied Computing (R0) (SpringerNature-43716)