Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 23 additions & 0 deletions Arrays/cpp/CheckIfSorted.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
#include <iostream>
#include <cmath>
using namespace std;

bool isSorted(int arr[], int n)
{
for(int i = 1; i < n; i++)
{
if(arr[i] < arr[i - 1])
return false;
}

return true;
}


int main() {

int arr[] = {5, 12, 30, 2, 35}, n = 5;

printf("%s", isSorted(arr, n)? "true": "false");

}
31 changes: 31 additions & 0 deletions Arrays/cpp/LeadersInAnArray.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
#include <iostream>
#include <cmath>
using namespace std;


void leaders(int arr[], int n)
{
int curr_ldr = arr[n - 1];

cout<<curr_ldr<<" ";

for(int i = n - 2; i >= 0; i--)
{
if(curr_ldr < arr[i])
{
curr_ldr = arr[i];

cout<<curr_ldr<<" ";
}
}
}



int main() {

int arr[] = {7, 10, 4, 10, 6, 5, 2}, n = 7;

leaders(arr, n);

}
39 changes: 39 additions & 0 deletions Arrays/cpp/LeftRotateByOne.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
#include <iostream>
#include <cmath>
using namespace std;

void lRotateOne(int arr[], int n)
{
int temp = arr[0];

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

arr[n - 1] = temp;
}

int main() {

int arr[] = {1, 2, 3, 4, 5}, n = 5;

cout<<"Before Rotation"<<endl;

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

cout<<endl;

lRotateOne(arr, n);

cout<<"After Rotation"<<endl;

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

}
43 changes: 43 additions & 0 deletions Arrays/cpp/MajorityElement.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
#include <iostream>
#include <cmath>
using namespace std;


int findMajority(int arr[], int n)
{
int res = 0, count = 1;

for(int i = 1; i < n; i++)
{
if(arr[res] == arr[i])
count++;
else
count --;

if(count == 0)
{
res = i; count = 1;
}
}

count = 0;

for(int i = 0; i < n; i++)
if(arr[res] == arr[i])
count++;

if(count <= n /2)
res = -1;

return res;
}



int main() {

int arr[] = {8, 8, 6, 6, 6, 4, 6}, n = 7;

cout<<findMajority(arr, n);

}