solved consecutiveCheckArray

Author: kotAPI

Arrays and Strings/C++/consecutiveCheckArray.cpp

@@ -0,0 +1,81 @@
+
+/*******************************************************************************************************
+/* ___ _ _ _ _ 
+/* / _ \ | | (_)| | | | 
+/* / /_\ \__ __ ___ | | __ _ ___ _ __ _ | |_ | |__ _ __ ___ ___ 
+/* | _ |\ \ /\ / / / _ \| | / _` | / _ \ | '__|| || __|| '_ \ | '_ ` _ \ / __| 
+/* | | | | \ V V / | __/| || (_| || (_) || | | || |_ | | | || | | | | |\__ \ 
+/* \_| |_/ \_/\_/ \___||_| \__, | \___/ |_| |_| \__||_| |_||_| |_| |_||___/ 
+/* __/ | 
+/* |___/ 
+/******************************************************************************************************/
+
+/************************************************
+/* Check if numbers in array are consecutive
+/************************************************/
+
+// Library imports
+#include <iostream>
+using namespace std;
+
+//Prototypes for the algorithms
+bool consecutiveCheckArray(int* arr,int len);
+void someSortingAlgorithm(int* arr,int length);
+
+int main(){
+// Lines to handle user input go here, be descriptive...
+// use cin, cout 
+int arr[] = {5, 2, 3, 1, 4};
+int arr2[] = {34, 23, 52, 12, 3};
+
+int arrayLength = sizeof(arr)/sizeof(arr[0]);
+int array2Length = sizeof(arr2)/sizeof(arr2[0]);
+
+
+// Call your algorithms here
+cout<<consecutiveCheckArray(arr, arrayLength)<<endl;
+cout<<consecutiveCheckArray(arr2, array2Length)<<endl;
+
+
+return 0;
+}
+
+/**********************************************************
+/* <consecutiveCheckArray>
+/*
+/* @description : description here
+/* @param : Integer<variable> (Datatype<variable_name>)
+/* @return : datatype (int,float,double etc)
+/* @complexity : Big O notation. (O(n),O(n^2) etc)
+/* @explanation : Detailed description about what the algorithm does
+/* @author : <Your name> @<GitHub handle> (John Doe @johndoe)
+/**********************************************************/
+bool consecutiveCheckArray(int* arr,int len){
+// Algorithm content goes here.
+someSortingAlgorithm(arr,len);
+
+int minElement =arr[0];
+
+for(int i=0;i<len;i++){
+if(arr[i]==minElement){
+minElement++;
+}
+else{
+return false;
+}
+}
+return true;
+}
+
+void someSortingAlgorithm(int* arr,int length){
+
+for(int i=0;i<length;i++){
+for(int j=i+1;j<length;j++){
+if(arr[i]>arr[j]){
+int temp = arr[i];
+arr[i] = arr[j];
+arr[j] = temp;
+}
+}
+}
+}

Arrays and Strings/README.md

@@ -86,12 +86,13 @@
   A[0] + A[1] + A[2] = A[4] + A[5] + A[6]
 
 
-#### 13. [Check if array elements are consecutive (consecutiveCheckArray))](C++/consecutiveCheckArray.cpp)
+#### 14. [Check if array elements are consecutive (consecutiveCheckArray))](C++/consecutiveCheckArray.cpp)
 
-  Given an unsorted array of numbers, write a function that returns true if array consists of consecutive numbers 
-  a) If array is {5, 2, 3, 1, 4}, then the function should return true because the array has consecutive numbers from 1 to 5.
- b) If array is {83, 78, 80, 81, 79, 82}, then the function should return true because the array has consecutive numbers from 78 to 83.
- c) If the array is {34, 23, 52, 12, 3 }, then the function should return false because the elements are not consecutive.
+ Given an unsorted array, write an algorithm to check if the given array has consecutive elements or not, must return true if it does, false if it doesn't.
+
+ A ={5, 2, 3, 1, 4}, must return true.
+ A ={83, 78, 80, 81, 79, 82}, must return true
+ A ={34, 23, 52, 12, 3 } must return false;
 
 
 TODO :