# Finding the Maximum Element

### Iterative Method :

```c
int maximum(struct node *ptr) {

    // Variable to keep track of maximum element
    // Initialise with INT_MIN 
    int max = INT_MIN;
    
    while (ptr != NULL) {
        // Change max value is current data is greater 
        if (ptr -> data > max) {
            max = ptr -> data;
        }
        ptr = ptr -> next;
    }
    return max;
    
}
```

### Recursive Method :

```c
int maximum(struct node *ptr) {

    int max;
    
    if (ptr == NULL) {
        return INT_MIN;
    }
    max = maximum(p -> next);
    return max > p -> data ? max : p -> data;

}
```

### Time and Space Complexity :

{% tabs %}
{% tab title="Iterative" %}
Time complexity : **O(n)**\
Space complexity : **O(n)**
{% endtab %}

{% tab title="Recursive" %}
Time complexity : **O(n)**\
Space complexity : **O(1)**
{% endtab %}
{% endtabs %}

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/linked-list/finding-the-maximum-element.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.