First and Last element in a rotated array code.

BabesGotByte_First_And_Last_Element_In_A_Roated_Array.cpp

@@ -0,0 +1,60 @@
+#include<iostream>
+using namespace std;
+#include<bits/stdc++.h>
+
+int find_start_index(vector<int> vec, int target){
+	int index=-1;
+	int start=0;
+	int end=vec.size()-1;
+	while(start<=end){
+		int mid=start+(end-start)/2;
+		if(vec[mid]>=target){
+			end=mid-1;
+		}
+		else{
+			start=mid+1;
+		}
+		if(vec[mid]==target){
+			index=mid;
+		}
+	}
+	return index;
+}
+
+int find_end_index(vector<int> vec, int target){
+	int index=-1;
+	int start=0;
+	int end=vec.size()-1;
+	while(start<=end){
+		int mid=start+(end-start)/2;
+		if(vec[mid]<=target){
+			start=mid+1;
+		}
+		else{
+			end=mid-1;
+		}
+		if(vec[mid]==target){
+			index=mid;
+		}
+	}
+	return index;
+}
+
+int main(){
+
+	int n;
+	cin>>n;
+	vector<int> v;
+	for(int i=0;i<n;i++){
+		int temp;
+		cin>>temp;
+		v.push_back(temp);
+	}
+	int target;
+	cin>>target;
+	int start=find_start_index(v,target);
+   	int end=find_end_index(v,target);
+  	cout<<start<<" "<<end<<endl;
+
+	return 0;
+}

BabesGotByte_QuickSort.cpp

@@ -0,0 +1,55 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+
+int partition (int arr[], int low, int high)
+{
+    if(low>=high){
+        return 0;
+    }
+    int pivot=arr[high];
+    int index=low;
+    while(low<high){
+        if(arr[low]<pivot){
+            swap(arr[low],arr[index]);
+            index++;
+        }
+        low++;
+    }
+    swap(arr[index],arr[high]);
+    return index;
+}
+
+void quickSort(int arr[], int low, int high)
+{
+    if (low < high)
+    {
+        int pi = partition(arr, low, high);
+        quickSort(arr, low, pi - 1);
+        quickSort(arr, pi + 1, high);
+    }
+}
+
+void printArray(int arr[], int size)
+{
+    int i;
+    for (i=0; i < size; i++)
+        cout<<arr[i]<<" ";
+    cout<<endl;
+}
+int main()
+{
+    int arr[1000],n,T,i;
+    cin>>T;
+    while(T--){
+        cin>>n;
+        for(i=0;i<n;i++)
+            cin>>arr[i];
+        quickSort(arr, 0, n-1);
+        printArray(arr, n);
+    }
+    return 0;
+}
+
+
+