{"id":27257,"date":"2018-01-05T22:13:39","date_gmt":"2018-01-05T16:43:39","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27257"},"modified":"2018-01-05T22:13:39","modified_gmt":"2018-01-05T16:43:39","slug":"c-algorithm-next-greater-element","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-algorithm-next-greater-element\/","title":{"rendered":"C Algorithm – Next Greater Element"},"content":{"rendered":"

Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element on the right side of x in array. <\/span>Elements for which no greater element exist, consider next greater element as -1.<\/p>\n

Examples:
\na) <\/strong>For any array, rightmost element always has next greater element as -1.
\nb) <\/strong>For an array which is sorted in decreasing order, all elements have next greater element as -1.
\nc) <\/strong>For the input array [4, 5, 2, 25}, the next greater elements for each element are as follows.<\/p>\n

Element       NGE\r\n   4      -->   5\r\n   5      -->   25\r\n   2      -->   25\r\n   25     -->   -1\r\n<\/pre>\n
d)<\/strong> For the input array [13, 7, 6, 12}, the next greater elements for each element are as follows.<\/p>\n
  Element        NGE\r\n   13      -->    -1\r\n   7       -->     12\r\n   6       -->     12\r\n   12     -->     -1<\/pre>\n[ad type=”banner”]\n
Method 1 (Simple)<\/strong>
\nUse two loops: The outer loop picks all the elements one by one. The inner loop looks for the first greater element for the element picked by outer loop. If a greater element is found then that element is printed as next, otherwise -1 is printed.<\/p>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ Simple C program to print next greater elements\/\/ in a given array#include<stdio.h> \/* prints element and NGE pair for all elements ofarr[] of size n *\/void printNGE(int arr[], int n){    int next, i, j;    for (i=0; i<n; i++)    {        next = -1;        for (j = i+1; j<n; j++)        {            if (arr[i] < arr[j])            {                next = arr[j];                break;            }        }        printf("%d -- %d\\n", arr[i], next);    }} int main(){    int arr[]= {11, 13, 21, 3};    int n = sizeof(arr)\/sizeof(arr[0]);    printNGE(arr, n);    getchar();    return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
11 -- 13\r\n13 -- 21\r\n21 -- -1\r\n3 -- -1<\/pre>\n
Time Complexity: O(n^2). The worst case occurs when all elements are sorted in decreasing order.<\/p>\n[ad type=”banner”]\nMethod 2 (Using Stack)<\/strong>
\nThanks to pchild <\/a>for suggesting following approach.
\n1) Push the first element to stack.
\n2) Pick rest of the elements one by one and follow following steps in loop.
\n\u2026.a) Mark the current element as next<\/em>.
\n\u2026.b) If stack is not empty, then pop an element from stack and compare it with next<\/em>.
\n\u2026.c) If next is greater than the popped element, then next <\/em>is the next greater element for the popped element.
\n\u2026.d) Keep popping from the stack while the popped element is smaller than next<\/em>. next<\/em> becomes the next greater element for all such popped elements
\n\u2026.g) If next <\/em>is smaller than the popped element, then push the popped element back.
\n3) After the loop in step 2 is over, pop all the elements from stack and print -1 as next element for them.<\/p>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ A Stack based C program to find next greater element\/\/ for all array elements.#include<stdio.h>#include<stdlib.h>#define STACKSIZE 100 \/\/ stack structurestruct stack{    int top;    int items[STACKSIZE];}; \/\/ Stack Functions to be used by printNGE()void push(struct stack *ps, int x){    if (ps->top == STACKSIZE-1)    {        printf("Error: stack overflow\\n");        getchar();        exit(0);    }    else    {        ps->top += 1;        int top = ps->top;        ps->items [top] = x;    }} bool isEmpty(struct stack *ps){    return (ps->top == -1)? true : false;} int pop(struct stack *ps){    int temp;    if (ps->top == -1)    {        printf("Error: stack underflow \\n");        getchar();        exit(0);    }    else    {        int top = ps->top;        temp = ps->items [top];        ps->top -= 1;        return temp;    }} \/* prints element and NGE pair for all elements ofarr[] of size n *\/void printNGE(int arr[], int n){    int i = 0;    struct stack s;    s.top = -1;    int element, next;     \/* push the first element to stack *\/    push(&s, arr[0]);     \/\/ iterate for rest of the elements    for (i=1; i<n; i++)    {        next = arr[i];         if (isEmpty(&s) == false)        {            \/\/ if stack is not empty, then pop an element from stack            element = pop(&s);             \/* If the popped element is smaller than next, then                a) print the pair                b) keep popping while elements are smaller and                stack is not empty *\/            while (element < next)            {                printf("\\n %d --> %d", element, next);                if(isEmpty(&s) == true)                   break;                element = pop(&s);            }             \/* If element is greater than next, then push               the element back *\/            if (element > next)                push(&s, element);        }         \/* push next to stack so that we can find           next greater for it *\/        push(&s, next);    }     \/* After iterating over the loop, the remaining       elements in stack do not have the next greater       element, so print -1 for them *\/    while (isEmpty(&s) == false)    {        element = pop(&s);        next = -1;        printf("\\n %d -- %d", element, next);    }} \/* Driver program to test above functions *\/int main(){    int arr[]= {11, 13, 21, 3};    int n = sizeof(arr)\/sizeof(arr[0]);    printNGE(arr, n);    getchar();    return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
 11 -- 13\r\n 13 -- 21\r\n 3 -- -1\r\n 21 -- -1\r\n<\/pre>\n
Time Complexity: O(n). The worst case occurs when all elements are sorted in decreasing order. If elements are sorted in decreasing order, then every element is processed at most 4 times.
\na) Initially pushed to the stack.
\nb) Popped from the stack when next element is being processed.
\nc) Pushed back to the stack because next element is smaller.
\nd) Popped from the stack in step 3 of algo.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
C Algorithm – Next Greater Element – Stack – Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[73012,79607],"tags":[81305,81307,81303,81300,81306,81299,81298,81302,81301,81304],"class_list":["post-27257","post","type-post","status-publish","format-standard","hentry","category-data-structures","category-stack","tag-next-greater-element-algorithm","tag-next-greater-element-c","tag-next-greater-element-ideserve","tag-next-greater-element-in-array-java","tag-next-greater-element-java-leetcode","tag-next-greater-element-leetcode","tag-next-greater-element-using-stack","tag-next-greater-element-using-stack-in-java","tag-next-greater-number","tag-next-smaller-element"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27257","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27257"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27257\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27257"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27257"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27257"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}