DSA-Course-GFG/arraylra.cpp at master · Pushkar012345/DSA-Course-GFG · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
/*
#include<iostream>
#include<cmath>
using namespace std;

void leftRotateOne(int arr[],int n){
    int temp=arr[0];
    for(int i=1;i<n;i++){
        arr[i-1]=arr[i];

    }
    arr[n-1]=temp;


}

void lRotate(int arr[],int d,int n){
    for(int i=0;i<d;i++){
        leftRotateOne(arr,n);

    }

}


int main(){
    int arr[]={1,2,3,4,5};
    int n=5,d=3;
    //int n=sizeof(arr)/sizeof(arr[0]);

    cout<<"Before function:"<<endl;
    for(int i=0;i<n;i++){
        cout<<arr[i]<<" ";
    }

    lRotate(arr,d,n);
    cout<<"After function"<<endl;
    for(int i=0;i<n;i++){
        cout<<arr[i]<<" ";
    }

    return 0;

}
*/

//Efficient Solution
/*
#include<iostream>
#include<cmath>
using namespace std;

void lRotate(int arr[],int d,int n){
    //temp
    int temp[d];

    //first taken side those elements which have to remove
    for(int i=0;i<d;i++){
        temp[i]=arr[i];
    }

    //shift all elements of prev arr which have to kept
    for(int i=d;i<n;i++){
        arr[i-d]=arr[i];
    }

    for(int i=0;i<d;i++){
        arr[n-d+i]=temp[i];
    }


}


//main function
int main(){
    int arr[]={1,2,3,4,5};
    int n=5,d=2;
    //int n=sizeof(arr)/sizeof(arr[0]);

    cout<<"Before function:"<<endl;
    for(int i=0;i<n;i++){
        cout<<arr[i]<<" ";
    }

    lRotate(arr,d,n);
    cout<<"After function"<<endl;
    for(int i=0;i<n;i++){
        cout<<arr[i]<<" ";
    }

    return 0;
}
*/

#include<iostream>
using namespace std;

void lRotate(int arr[],int d,int n){
    int temp[d];
    for(int i=0;i<d;i++){
        temp[i]=arr[i];
    }

    for(int i=d;i<n;i++){
        arr[i-d]=arr[i];
    }

    for(int i=0;i<d;i++){
        arr[n-d+i]=temp[i];
    }
}


int main(){
     int arr[]={1,2,3,4,5};
    int n=5,d=2;
    //int n=sizeof(arr)/sizeof(arr[0]);

    cout<<"Before function:"<<endl;
    for(int i=0;i<n;i++){
        cout<<arr[i]<<" ";
    }

    lRotate(arr,d,n);
    cout<<"After function"<<endl;
    for(int i=0;i<n;i++){
        cout<<arr[i]<<" ";
    }

    return 0;
}