Linear Search

#include <iostream>
#include <limits.h>
using namespace std;

void printArray(int arr[], int size) {
	
	for(int i=0; i<size; i++) {
		cout << arr[i] << " ";
	}
	cout << endl;
}

void inc(int arr[], int size) {
	arr[0] = arr[0] + 10;

	printArray(arr, size);
}

bool find(int arr[], int size, int key) {

	//linear search

	for(int i=0; i<size; i++) {
		if(arr[i] == key) 
			return true;
	}

	//not present
	return false;
}

int main() {	
  //array declare
  int arr[7];
  cout << arr << endl;
  cout << &arr << endl;
  cout << "Array created successfully" << endl;

  //array initialise
  int arr[] = {2,3,4,6,7};
  int brr[5] = {2,4,6,8,10};
  int crr[10] = {2,4,6,8,10};
  //errror
  //int drr[4] = {2,4,6,8,10};
  cout << "Array initialised successfully" << endl;

  int arr[] = {1,3,5,7,9};

  //printing all values
  for(int index=0; index<5; index++) {
    cout << arr[index] << " ";
  }
  int n;
  cin >> n;
  //BAD Practice
  int arr[n];

  //static array 
  int arr[10000];

  cout << "Enter the input values in array " << endl;
  //taking input in array
  for(int i=0; i<10; i++) {
    cin >> arr[i] ;
  }

  //printing
  cout << "printing the values in array" << endl;
  for(int i=0; i<10; i++) {
    cout << arr[i] << " ";
  }

  int arr[500];

  int n;
  cout << "How many numbers you want to add in array" << endl;

  cin >> n;

  cout << "Enter the numbers " << endl;
  for(int i=0; i<n; i++) {
    cin >> arr[i];
  }

  //print doubles
  cout << "Doubles: ";
  for(int i=0; i<n; i++) {
    cout << 2 * arr[i] << " ";
  }

	int arr[5] = {1,3,5,7,9};

	for(int i=0; i<5; i++) {
		arr[i]  = 1;
	}

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

	int arr[10] = {1,2};
	
	for(int i=0; i<10; i++) {
		cout << arr[i] << " ";
	}


	int arr[10] = {0};
	

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


		int arr[] = {5,6};
	int size = 2;
	inc(arr, size);

	printArray(arr, size);

	int arr[5] = {1,3,5,7,8};
	int size = 5;

	cout << "Enter the key to find " << endl;
	int key;
	cin  >> key;

	if(find(arr,size, key)) {
		cout << "Found " << endl;
	}
	else {
		cout << "not Found " << endl;
	}


	//Q3 Number of 0's and 1's
	int arr[] = {0,1,1,1,0,0,0,0,1,0,1,0,1,0,1, 2, 4 ,5, 7};

	int size = 19;

	int numZero = 0;
	int numOne = 0;

	for(int i=0; i<size; i++) {
		//if zero found, increment numZero
		if(arr[i] ==0 ) {
			numZero++;
		}
		//if One found, increment numOne
		if(arr[i] == 1) {
			numOne++;
		}
	}

	cout << "number of zeroes " << numZero << endl;
	cout << "number of ones "  << numOne << endl;



	//Q4 Minimum and Maximum Element
	int arr[] = {2,4,6,1,3,7,9,12,56,43,21};
	int size = 11;
	//initialse the maxi variable with the 
	//minimum possible integer value
	int maxi = INT_MIN;	
	int mini = INT_MAX;

	for(int i=0; i<size; i++) {
		if(arr[i] < mini) {
			//found a number gretaer than maxi, update maxi
			mini = arr[i] ;
		}
	}

	cout << "minimum number is " << mini  << endl;


	int arr[8] = {10,20,30,40,50,60,70,80};
	int size = 8;

	int start = 0;
	int end = size-1;

	while(start <= end) {

		if(start == end ) {
			cout << arr[start] <<" ";
		}
		else {
			cout << arr[start] << " ";
			cout << arr[end] << " ";
		}

		start++;
		end--;
	}

	//Q5 Reverse An Array
	int arr[8] = {10,20,30,40,50,60,70};
	int size = 7;

	int start = 0;
	int end = size-1;

	while(start<=end) {

		//step1:
		swap(arr[start], arr[end]);
		//step:2
		start++;
		//step3
		end--;
		
	}

	//printing array
	for(int i=0; i<size; i++) {
		cout << arr[i] << " ";
	}

	

  return 0;
}