Rahul Singh rahuladream

## predict_fuel_efficiency.py
from __future__ import absolute_import, division, print_function, unicode_literals
import matplotlib.pyplot as plt
import pandas as pd
import seaborn as sns

import tensorflow as tf
from tensorflow import keras
from tensorflow.keras import layers

print(tf.__version__)

## recorder.html
<script src="js/jquery.min.js"></script>
<script type="text/javascript" src="js/mp3recorder.js"></script>

<script type="text/javascript">
    var audio_context;

    function __log(e, data) {
      log.innerHTML += "\n" + e + " " + (data || '');
    }

## simple_sum_of_array.cpp
#include <bits/stdc++.h>
using namespace std;
int simpleArraySum(int n, vector <int> ar)
{
    int sum = 0;
    for(int i = 0; i < n ; i++){
        sum += ar[i];
    }
    return(sum);
}

## stack_implement.cpp
#include <bits/stdc++.h>
using namespace std;
int max,i,n;
int top=-1;
class stack
{

   int s[20];
   public:
       void push();

## merge_sort.cpp
#include <bits/stdc++.h>
using namespace std;
void mergesort(int [],int,int);
void merge(int[],int,int,int);

int main()
{
    int a[30],p,r,q,n;
    cout<<"enter the number of element";
    cin>>n;

## quick_sort.cpp
#include <bits/stdc++.h>
using namespace std;
void quicksort(int[],int,int);
int partition(int[],int,int);
// Input and Main Function
int main()
{
    int a[30],p,n,r;
    cout<<"enter the number of element";
    cin>>n;

## upper_string.cpp
#include <bits/stdc++.h>
using namespace std;
char* mystrupr(char *s);
int main()
{
    char str[20];
    puts("Enter a string");
    cin>>str;
    mystrupr(str);
    cout<<"Upper case is : >> "<<str;

## selection_sort.cpp
#include<iostream>

using namespace std;

int main()
{
    int i,j,n,loc,temp,min,a[30];
    cout<<"Enter the number of elements:";
    cin>>n;
    cout<<"Enter the element";

## insertion_sort.cpp
#include <bits/stdc++.h>
using namespace std;

void insertionSort(int arr[], int length);
void printArray(int array[],int size);

int main()
{
    int array[5] = {5,4,3,2,1};
    insertionSort(array,5);

## bubble_sort.cpp
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a[6] = {5,1,6,2,3};
    int i,j,temp;
    for(i=0; i<6; i++)
    {
        int flag=0;
        for(j=0; j<(6-i); j++)