Give a recursive algorithm for finding a mode of a list of integers. (A mode is an element in the list that occurs at least as often as every other element.)

Question

Give a recursive algorithm for finding a mode of a list of integers. (A mode is an element in the list that occurs at least as often as every other element.)

Accepted Answer

The recursive algorithm is,

$procedure mod (a_{1}, a_{2}, \dots, a_{n} : integers with n \geq 1) L := \{a_{1}, a_{2}, \dots, a_{n}\} if n = 1 then return a_{1} else \begin{aligned} L := L - \{a_{n}\} k := 1 \\ for i := 1 to n = 1 \\ if a_{n} = a_{i} then \\ L := L - \{a_{i}\} k := k + 1 \end{aligned} if k = n then return a_{n} else \begin{aligned} x := \mod (L) m := 0 \\ for i := 1 to n - 1 \\ if a_{n} = a_{i} then \\ m := m + 1 \\ if k \geq m then \\ return a_{n} \end{aligned} else return x$

Find Study Materials for

Create Study Materials

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

Give a recursive algorithm for finding a mode of a list of integers. (A mode is an element in the list that occurs at least as often as every other element.)

Step by Step Solution

Step 1: Describe the given information

Step 2: Give a recursive algorithm for computing finding a mode of a list of integers

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

Give a recursive algorithm for finding a mode of a list of integers. (A mode is an element in the list that occurs at least as often as every other element.)

Step by Step Solution

Step 1: Describe the given information

Step 2: Give a recursive algorithm for computing finding a mode of a list of integers

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Decision Maths

Probability and Statistics

Statistics

Mechanics Maths

Geometry

Calculus

Pure Maths