# Finding Max & Min in Single Scan

### Procedure : 

* Take array and array size (n) as input
* Assign max and min variable to first element initially.
* Iterate from index = 1 to n
* If the element at index 1 is less than min, change min value.
* If not, check if it greater than max. If so, change max value.

```c
void findMinMax(int a[], int n) {

    // Assign min and max to first element
    int min = a[0];
    int max = a[0];
    
    for (int i = 1; i < n; i++) {
        // If current element is less than min, update min.
        if (a[i] < min) {
            min = a[i];
        }
        // If current element is greater than max, update max.
        else if (a[i] > max) {
            max = a[i];
        }
        
    }
    
    printf("The maximum element is %d\n", max);
    printf("The minimum element is %d\n", min);

}
```

Contributed by Nitin Ranganath


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://nitinranganath.gitbook.io/data-structures/arrays/finding-max-and-min-in-single-scan.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.