Book edition 7th

Author(s) Kenneth H. Rosen

Pages 808 pages

ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Short Answer

Describe an algorithm that takes an input a list of integers and finds the number of negative integers in the list.

The algorithm that takes as input a list of integers for finding number of negative integers is as follows:

$p r o c e d u r e c o u n t n e g (a_{1}, a_{2}, . . . . ., a_{n} : i n t e g e r s w i t h n \geq 1) K : = 0 f o r i = 1 t o n i f a_{i} < 1 t h e n k : K + 1 r e t u r n k$

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :

TABLE OF CONTENTS

Step 1: Describing the steps needed to write the required algorithm:

We can call the algorithm as ‘countneg’ and input is a list of n integers

$p r o c e d u r e c o u n t n e g (a_{1}, a_{2}, . . . . ., a_{n} : i n t e g e r s w i t h n \geq 1)$

We initially define the variable k as 0 ( k will count the negative numbers).

$K : = 0$

For every integer between 1 and n , $a_{i}$ is negative, then we increase the variable by 1.

$f o r i = 2 t o n i f a_{i} < 1 t h e n k : K + 1$

Finally, we return the k which counts the negative numbers in the set

return k

Step 2: Combining all the steps to form an algorithm:

The algorithm is as follows:

$p r o c e d u r e c o u n t n e g (a_{1}, a_{2}, . . . . ., a_{n} : i n t e g e r s w i t h n \geq 1) K : = 0 f o r i = 1 t o n i f a_{i} < 1 t h e n k : K + 1 r e t u r n k$

Therefore, the required algorithm is designed for the given conditions.

Find Study Materials for

Create Study Materials

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

Describe an algorithm that takes an input a list of integers and finds the number of negative integers in the list.

Step by Step Solution

Step 1: Describing the steps needed to write the required algorithm:

Step 2: Combining all the steps to form an algorithm:

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

Describe an algorithm that takes an input a list of integers and finds the number of negative integers in the list.

Step by Step Solution

Step 1: Describing the steps needed to write the required algorithm:

Step 2: Combining all the steps to form an algorithm:

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Decision Maths

Calculus

Probability and Statistics

Statistics

Mechanics Maths

Geometry

Pure Maths