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 puts the first three terms of a sequence of integers of arbitrary length in increasing order.

Algorithm that that puts the first three terms of a sequence of integers of arbitrary length in increasing order is:

procedure order first three ( $x_{1}, x_{2}, x_{3}, . . ., x_{n}$ : integers with $n \leq 3$ ).

If $x_{1} < x_{2}$

then interchange $x_{1}$ and $x_{2}$ i.e., $x_{1} < x_{2}$

If $x_{2} < x_{3}$

Then interchange $x_{2}$ and $x_{3}$ i.e., $x_{2} < x_{3}$

return $x_{1} < x_{2} < x_{3}$

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :

TABLE OF CONTENTS

Step 1: algorithm

Algorithm is a finite sequence of precise instructions that are used for performing a computation or for a sequence of steps.

First, Assume the finite sequence of integers $x_{1}, x_{2}, x_{3}, . . ., x_{n}$ .

The algorithm called order first three and the input has finite integers $x_{1}, x_{2}, x_{3}, . . ., x_{n}$ .

Step 2: Interchange for first and second term

procedure order first three ( $x_{1}, x_{2}, x_{3}, . . ., x_{n}$ : integers with $n \leq 3$ ).

Use the variable to interchange variables.

First check if the integer $x_{1}$ and $x_{2}$ are in increasing order, if $x_{1}$ and $x_{2}$ are not in increasing order then interchange the variables.

If $x_{1} > x_{2}$

then interchange $x_{1}$ and $x_{2}$ i.e., $x_{1} < x_{2}$

Step 3: Interchange for second and third term

Now check if the integer $x_{2}$ and $x_{3}$ are in increasing order, if $x_{2}$ and $x_{3}$ are not in increasing order then interchange the variables.

If $x_{2} > x_{3}$

Then interchange $x_{2}$ and $x_{3}$ i.e., $x_{2} < x_{3}$

Step 4: Combine the above steps

Combine the above steps, the algorithm is:

procedure order first three ( $x_{1}, x_{2}, x_{3}, . . ., x_{n}$ : integers with $n \leq 3$ ).

If $x_{1} > x_{2}$

then interchange $x_{1}$ and $x_{2_{}}$ i.e., $x_{1} > x_{2}$

If $x_{2} > x_{3}$

Then interchange $x_{2}$ and $x_{3}$ i.e., $x_{2} > x_{3}$

return $x_{1} < x_{2} < x_{3}$

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 puts the first three terms of a sequence of integers of arbitrary length in increasing order.

Step by Step Solution

Step 1: algorithm

Step 2: Interchange for first and second term

Step 3: Interchange for second and third term

Step 4: Combine the above steps

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 puts the first three terms of a sequence of integers of arbitrary length in increasing order.

Step by Step Solution

Step 1: algorithm

Step 2: Interchange for first and second term

Step 3: Interchange for second and third term

Step 4: Combine the above steps

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