Sorted_LL.cpp

#include<bits/stdc++.h>
using namespace std;
class Node{
    public:
    int data;
    Node* next;

};
Node* head;


void Create(int Arr[],int size){
    Node* temp;
    Node* last;

    head = new Node;
    head->data= Arr[0];
    head->next= nullptr;
    
    last=head;
    
    // creating linked list

    for(int i=1;i<size;i++ ){
        temp = new Node;

        temp->data=Arr[i];
        temp->next=nullptr;

        last->next=temp;
        last=temp;

    }
    
}

void if_sorted(Node* P){
    Node* q=head;
    P=head->next;
    while (P!=NULL){
        if(P->data>q->data){
            P=P->next;
            q=q->next;
        }
        else
        {
            cout<<"not sorted";
            exit(0);
        }
    }
    cout<<"sorted";
}

void Display(Node* P){
    while (P!=nullptr)
    {
        cout<<P->data<<"->";
        P=P->next;
        
    }
}

int main(){

    int A[]={2,1,3,4,5,6,7,8};
    int size=(sizeof(A)/sizeof(A[0]));
    
    Create(A,size);
    Display(head);
    cout<<endl;
    if_sorted(head);
    cout<<endl;
    Display(head);
    

    return 0;
}