Scribd
Upload
56 views

What Is An Iterative Algorithm?

Iterative algorithms solve problems by successively refining an initial solution estimate through repeated calculations. They work by iterating, or looping, through a collection of data to process each element and gradually achieve the desired outcome. For example, an iterative algorithm can find the minimum and maximum elements in an array by starting with the first element as the initial minimum and maximum, then looping through the rest of the array to update those values if a smaller minimum or larger maximum is found.

Uploaded by

akhtarrasool
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
56 views

What Is An Iterative Algorithm?

Iterative algorithms solve problems by successively refining an initial solution estimate through repeated calculations. They work by iterating, or looping, through a collection of data to process each element and gradually achieve the desired outcome. For example, an iterative algorithm can find the minimum and maximum elements in an array by starting with the first element as the initial minimum and maximum, then looping through the rest of the array to update those values if a smaller minimum or larger maximum is found.

Uploaded by

akhtarrasool
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

What is an iterative algorithm?

Iterate means to move through some data collection (for example


array) by using any loop based technique in order to process every
element of data collection or to achieve some specific goal. Thus
iterative method is the process of solving a problem which finds
successive approximations for solution, starting from an initial
guess. The result of repeated calculations is a sequence of
approximate values for the quantities of interest.

Example of iterative method:


Finding minimum and maximum element in array

Below is the step by step descriptive logic to find maximum or


minimum in array using iterative logic.

1. input size of array in ‘size’ and elementa of array in ‘arr’ array.


2. Declare two variables max and min to store maximum and
minimum. Assume first array element as maximum and
minimum both, say max = arr[0] and min = arr[0].
3. Iterate through array to find maximum and minimum element in
array. Run loop from first to last array element i.e. 0 to size - 1.
Loop structure should look like for(i=0; i<size; i++).
4. Inside loop for each array element check for maximum and
minimum. Assign current array element to max, if (arr[i] > max).
Assign current array element to min if it is less than min i.e.
perform min = arr[i] if (arr[i] < min).
5. Display min and max values.

You might also like