added arrays folder and programs

Author: thatsabhishek

README.md

@@ -45,6 +45,11 @@ This repo includes:
   - [Functions](./milestone2/functions/)
     - [Fahrenheit to Celsius Table](./milestone2/functions/FahrenheittoCelsiusTable.cpp)
     - [Fibonacci Number](./milestone2/functions/FibonacciNumber.cpp)
+  - [Arrays](./milestone2/arrays/)
+    - [Array Sum](./milestone2/arrays/arraysum.cpp)
+    - [Linear Search](./milestone2/arrays/linearsearch.cpp)
+    - [Arrange Numbers in Array](./milestone2/arrays/ArrangeNumbersinArray.cpp)
+    - [Swap Alternate](./milestone2/arrays/SwapAlternate.cpp)
 
 # Coding Ninjas
 ## Rate my Repo ⭐!!!

milestone2/arrays/ArrangeNumbersinArray.cpp

@@ -0,0 +1,60 @@
+// You have been given an empty array(ARR) and its size N. The only input taken from the user will be N and you need not worry about the array.
+// Your task is to populate the array using the integer values in the range 1 to N(both inclusive) in the order - 1,3,5,.......,6,4,2.
+// Note: You need not print the array. You only need to populate it.
+
+// Input Format :
+// The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+// The first and the only line of each test case or query contains an integer 'N'.
+
+// Output Format :
+// For each test case, print the elements of the array/list separated by a single space.
+// Output for every test case will be printed in a separate line.
+
+//My Code
+void arrange(int *arr, int n)
+{
+ 	int i,j=0;
+	for(i = 1; i <= n; i++)
+	{
+		if( i % 2 != 0)
+		{
+			arr[j] = i;
+			j++;
+		}
+	}
+	
+	for(i = n ; i > 0;i--)
+	{
+		if( i%2 == 0)
+		{
+			arr[j] = i;
+			j++ ;
+		}
+	}
+}
+
+// Main Code
+#include <iostream>
+using namespace std;
+
+#include "solution.h"
+
+int main()
+{
+	int t;
+	cin >> t;
+	while (t--)
+	{
+		int n;
+		cin >> n;
+
+		int *arr = new int[n];
+		arrange(arr, n);
+		for (int i = 0; i < n; i++)
+		{
+			cout << arr[i] << " ";
+		}
+		cout << endl;
+		delete [] arr;
+	}
+}

milestone2/arrays/SwapAlternate.cpp

@@ -0,0 +1,55 @@
+// You have been given an array/list(ARR) of size N. You need to swap every pair of alternate elements in the array/list.
+// You don't need to print or return anything, just change in the input array itself.
+
+// Input Format :
+// The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+// First line of each test case or query contains an integer 'N' representing the size of the array/list.
+// Second line contains 'N' single space separated integers representing the elements in the array/list.
+
+// Output Format :
+// For each test case, print the elements of the resulting array in a single row separated by a single space.
+// Output for every test case will be printed in a separate line.
+
+// My Code
+void swapAlternate(int *arr, int size)
+{
+    int temp;
+    int i = 0, j = i+1;
+    
+    while(j < size){
+        temp = arr[i];
+        arr[i] = arr[j];
+        arr[j] = temp;
+        i=i+2;
+        j=i+1;
+    }
+}
+
+// Main Code
+#include <iostream>
+using namespace std;
+
+#include "solution.h"
+
+int main()
+{
+	int t;
+	cin >> t;
+	while (t--)
+	{
+		int size;
+		cin >> size;
+		int *arr = new int[size];
+		for (int i = 0; i < size; i++)
+		{
+			cin >> arr[i];
+		}
+		swapAlternate(arr, size);
+		for (int i = 0; i < size; i++)
+		{
+			cout << arr[i] << " ";
+		}
+		cout << endl;
+		delete [] arr;
+	}
+}

milestone2/arrays/arraysum.cpp

@@ -0,0 +1,21 @@
+// Given an array of length N, you need to find and print the sum of all elements of the array.
+
+#include<iostream>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    
+    int arr[n];
+    for(int i=0; i<n;i++){
+        cin>>arr[i];
+    }
+
+    int sum = 0;
+    for(int i=0; i<n; i++){
+        sum = sum+arr[i];
+    }
+
+    cout<<sum<<endl;
+}

milestone2/arrays/linearsearch.cpp

@@ -0,0 +1,55 @@
+// You have been given a random integer array/list(ARR) of size N, and an integer X. You need to search for the integer X in the given array/list using 'Linear Search'.
+//  You have been required to return the index at which X is present in the array/list. 
+// If X has multiple occurrences in the array/list, then you need to return the index at which the first occurrence of X would be encountered. 
+// In case X is not present in the array/list, then return -1.
+// 'Linear search' is a method for finding an element within an array/list. It sequentially checks each element of the array/list until a match is found or the whole array/list has been searched.
+
+// Input format :
+// The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+// First line of each test case or query contains an integer 'N' representing the size of the array/list.
+// Second line contains 'N' single space separated integers representing the elements in the array/list.
+// Third line contains the value of X(integer to be searched in the given array/list)
+
+// Output format :
+// For each test case, print the index at which X is present or -1, otherwise.
+// Output for every test case will be printed in a separate line.
+
+
+// My Code
+int linearSearch(int *arr, int n, int x)
+{
+    for(int i=0; i<n; i++){
+        if (arr[i] == x){
+            return i;
+        }
+    }
+    return -1;
+}
+
+// Main Code
+#include <iostream>
+using namespace std;
+
+#include "solution.h"
+
+int main()
+{
+	int t;
+	cin >> t;
+	while (t--)
+	{
+		int n;
+		cin >> n;
+		int *arr = new int[n];
+		for (int i = 0; i < n; ++i)
+		{
+			cin >> arr[i];
+		}
+		int val;
+		cin >> val;
+		cout << linearSearch(arr, n, val) << endl;
+	}
+	return 0;
+}
+
+