{{ message }}

Instantly share code, notes, and snippets.

🏁
Towards Goal

🏁
Towards Goal
Last active Jul 18, 2019
View LogicGate Connector.py
 class LogicGate: def __init__(self,n): self.name = n self.output = None def getLabel(self): return self.name def getOutput(self):
Created Jun 11, 2019
View 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__)
Created Apr 15, 2018
View recorder.html

Created Nov 5, 2017
Sample Input 6 1 2 3 4 10 11 |||| Sample Output 31
View simple_sum_of_array.cpp
 #include using namespace std; int simpleArraySum(int n, vector ar) { int sum = 0; for(int i = 0; i < n ; i++){ sum += ar[i]; } return(sum); }
Created Oct 9, 2017
Stack Implementation
View stack_implement.cpp
 #include using namespace std; int max,i,n; int top=-1; class stack { int s[20]; public: void push();
Created Oct 9, 2017
Merge Sort
View merge_sort.cpp
 #include 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;
Created Oct 9, 2017
Quick Sort
View quick_sort.cpp
 #include 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;
Created Oct 9, 2017
Upper String Without using function
View upper_string.cpp
 #include using namespace std; char* mystrupr(char *s); int main() { char str[20]; puts("Enter a string"); cin>>str; mystrupr(str); cout<<"Upper case is : >> "<
Created Oct 9, 2017
Selection Sort
View selection_sort.cpp
 #include 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";
Created Oct 9, 2017
Insertion Sort
View insertion_sort.cpp
 #include 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);