diff --git a/.gitignore b/.gitignore
index d55858e..a171841 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,3 +1,6 @@
 __pycache__
 .DS_Store
 a.out
+a.exe
+numpp.hpp.gch
+.vscode
diff --git a/README.md b/README.md
index 3403c7b..e7c9718 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,6 @@
 # NumPP
 
 ## C++ Port to NumPy
+
+
+main.cpp will work fine with Codeblocks
diff --git a/src/numpp.cpp b/src/numpp.cpp
index 8dd44e0..0848eb6 100644
--- a/src/numpp.cpp
+++ b/src/numpp.cpp
@@ -1,6 +1,7 @@
 #include <iostream>
 #include <typeinfo>
 #include <map>
+#include <random>
 
 #include "numpp.hpp"
 
@@ -22,6 +23,7 @@ template <class T>
 numpp<T>::numpp(vector<int> dim) {
   this->dim = dim;
   this->ndim = 1;
+  is_zero = false;
   for(int i=0; i<this->dim.size(); i++)
     this->ndim *= this->dim[i];
   try {
@@ -59,6 +61,63 @@ void numpp<T>::reshape(vector<int> new_dim) {
     cerr<<"\033[1;31m Error\033[0m: Invalid dimensions!";
 }
 
+template <class T>
+uint64_t numpp<T>::max() {
+  long long int maximum=data[0];
+  long i=1;
+  while(i!=ndim)
+  {
+    if(data[i]>maximum)
+     maximum=data[i++];
+  }
+  return maximum;
+
+}
+
+template <class T>
+uint64_t numpp<T>::min() {
+  long long int minimum=data[0];
+  long i=1;
+  while(i!=ndim)
+  {
+    if(data[i]<minimum)
+     minimum=data[i];
+
+     i++;
+  }
+  return minimum;
+
+}
+
+template <class T>
+void numpp<T>::zeros() {
+ is_zero = true;
+}
+
+template <class T>
+void numpp<T>::print() {
+ long i=1;
+ cout<<endl;
+ if(is_zero) {
+   cout<<"{";
+   i--;
+    while(i != ndim-1) {
+      cout<<"0, ";
+      i++;
+    }
+    cout<<"0}";
+  } else {
+   cout<<"{ "<<data[0];
+   if(ndim==1)
+   cout<<" }";
+   else
+      while(i!=ndim)
+        cout<<", "<<data[i++];
+   cout<<" }";
+   }
+  cout<<endl;
+}
+
 template <class T>
 void numpp<T>::push_vec(vector<int> dim, vector<T> data) {
   if(shape_match(dim)) {
@@ -73,3 +132,128 @@ void numpp<T>::push_vec(vector<int> dim, vector<T> data) {
   else
     cerr<<"\033[1;31m Error\033[0m: Dimension doesn't match declared numpp dimension!\n";
 }
+
+template <class T>
+void numpp<T>::add(numpp np1,numpp np2){
+	cout<<endl;
+   for(int i=0;i<this->dim.size()*dim.size();i++)
+   {
+   	this->data[i]=np1.data[i]+np2.data[i];
+   	cout<<this->data[i]<<" ";
+   }
+}
+template <class T>
+void numpp<T>::sub(numpp np1,numpp np2){
+	cout<<endl;
+   for(int i=0;i<this->dim.size()*dim.size();i++)
+   {
+   	this->data[i]=np1.data[i]-np2.data[i];
+   	cout<<this->data[i]<<" ";
+   }
+}
+
+template <class T>
+void numpp<T>::search(T a, string ch) {
+  if(ch == "linear") {
+    int count=0;
+    for(int i=0; i<ndim; i++)
+      if(a == data[i])
+        count++;
+
+    if(count == 0)
+      cout<<a<<" not found!";
+    else
+      cout<<a<<" found!";
+  } else if(ch == "binary") {
+    int i, j;
+    T temp;
+    for (i = 0; i < ndim-1; i++) {
+      for (j = 0; j < ndim-i-1; j++) {
+        if (data[j] > data[j+1]) {
+          temp=data[j];
+          data[j]=data[j+1];
+          data[j+1]=temp;
+        }
+      }
+    }
+    int count=0;
+    int start, end, middle;
+    start=0;
+    end=ndim-1;
+    for(int i=0;i<ndim;i++) {
+      middle=(start+end)/2;
+      if(a==data[middle])
+        count++;
+      else if(a>data[middle])
+        start=middle+1;
+      else
+        end=middle-1;
+    }
+    if(count>0)
+      cout<<a<<" found!";
+    else
+      cout<<a<<" not found!";
+  }
+}
+
+template <class T>
+void numpp<T>::sort(string ch) {
+  if(ch=="Bubble") {
+    int i, j;
+    T temp;
+    for (i = 0; i < ndim-1; i++) {
+      for (j = 0; j < ndim-i-1; j++) {
+        if (data[j] > data[j+1]) {
+          temp=data[j];
+          data[j]=data[j+1];
+          data[j+1]=temp;
+        }
+      }
+    }
+  } else if(ch=="Insertion") {
+    int i, j;
+    T key;
+    for (i = 1; i < ndim; i++) {
+      key = data[i];
+      j = i - 1;
+      while (j >= 0 && data[j] > key) {
+        data[j + 1] = data[j];
+        j = j - 1;
+      }
+      data[j + 1] = key;
+    }
+  } else if(ch=="Selection") {
+    int i, j, min_idx;
+    T temp;
+
+    for (i = 0; i < ndim-1; i++) {
+      min_idx = i;
+      for (j = i+1; j < ndim; j++)
+      if (data[j] < data[min_idx])
+        min_idx = j;
+      temp=data[min_idx];
+      data[min_idx]=data[i];
+      data[i]=temp;
+    }
+    for(i=0;i<ndim;i++)
+      cout<<data[i];
+    }
+ }
+
+ template <class T>
+ void numpp<T>::random_normal(double mean, double stddev) {
+   default_random_engine generator;
+   normal_distribution<double> distribution(mean, stddev);
+   this->data.clear();
+   for(int i=0; i<this->ndim; i++)
+     this->data.push_back(distribution(generator));
+ }
+
+ template <class T>
+ void numpp<T>::random_uniform(double mean, double stddev) {
+   default_random_engine generator;
+   uniform_real_distribution<double> distribution(mean, stddev);
+   this->data.clear();
+   for(int i=0; i<this->ndim; i++)
+    this->data.push_back(distribution(generator));
+ }
diff --git a/src/numpp.hpp b/src/numpp.hpp
index e0976f8..254f401 100644
--- a/src/numpp.hpp
+++ b/src/numpp.hpp
@@ -10,6 +10,7 @@ class numpp {
   private:
     vector<int> dim;
     vector<T> data;
+    bool is_zero;
     uint64_t ndim;
     int shape_match(vector<int>);
   public:
@@ -17,6 +18,16 @@ class numpp {
     void shape();
     void reshape(vector<int>);
     void push_vec(vector<int>, vector<T>);
+    uint64_t max();
+    uint64_t min();
+    void zeros();
+    void print();
+    void add(numpp,numpp);
+    void sub(numpp,numpp);
+    void search(T, string);
+    void sort(string);
+    void random_normal(double, double);
+    void random_uniform(double, double);
 };
 
 #endif
diff --git a/src/old/Makefile b/src/old/Makefile
deleted file mode 100644
index 109cb7d..0000000
--- a/src/old/Makefile
+++ /dev/null
@@ -1,5 +0,0 @@
-arr:
-
-	g++ -std=c++11 -o arr arr.cpp
-
-	./arr
diff --git a/src/old/array.cpp b/src/old/array.cpp
deleted file mode 100644
index d95cc09..0000000
--- a/src/old/array.cpp
+++ /dev/null
@@ -1,160 +0,0 @@
-#include <iostream>
-#include <vector>
-#include <sstream>
-#include <algorithm>
-#include <string>
-#include <iterator>
-
-#include <chrono>
-
-using namespace std;
-
-using namespace std::chrono;
-
-vector<int> split_string(string s) {
-  vector<int> ret_vec;
-  string buf = "";
-  int temp;
-  for(int i=0; i<s.length(); i++) {
-    if(s[i] == ',') {
-      stringstream int_str(buf);
-      int_str >> temp;
-      ret_vec.push_back(temp);
-      buf = "";
-      continue;
-    }
-    buf += s[i];
-  }
-
-  stringstream int_str(buf);
-  int_str >> temp;
-  ret_vec.push_back(temp);
-
-  return ret_vec;
-}
-
-vector<int> mul_ret(vector<int> dimensions) {
-
-  reverse(dimensions.begin(), dimensions.end());
-
-  vector<int> ret_arr;
-  int mul = 1;
-  for(int i=0; i<dimensions.size(); i++) {
-    mul *= dimensions[i];
-    ret_arr.push_back(mul);
-  }
-
-  reverse(ret_arr.begin(), ret_arr.end());
-
-  return ret_arr;
-}
-
-vector<int> partitioning(int size, int partition_size) {
-  vector<int> ret_vec;
-  for(int i=0; i<size; i++) {
-    if(i%partition_size == 0)
-      ret_vec.push_back(i);
-  }
-
-  return ret_vec;
-}
-
-int index(int idx, vector<int> row, int prev_dim=0) {
-  int ind=0;
-  //vector<int> indexing;
-  int indexing;
-  for(int i=0; i<row.size(); i++) {
-    if(ind == prev_dim && prev_dim > 0)
-      ind = 0;
-    if(row[i] > idx) {
-      return indexing;
-    }
-    if(idx == row[i]) {
-      return ind;
-    }
-    indexing = ind;
-    ind++;
-  }
-  return ind-1;
-}
-
-int main() {
-
-  string s;
-
-  cout<<"Enter the dimensions: ";
-  getline(cin, s);
-
-  auto start = high_resolution_clock::now();
-
-  std::string::iterator end_pos = std::remove(s.begin(), s.end(), ' ');
-  s.erase(end_pos, s.end());
-
-  vector<int> dimensions = split_string(s);
-  dimensions.push_back(1);
-
-  int npp_arr_size = 1;
-
-  for(int i=0; i<dimensions.size(); i++)
-    npp_arr_size *= dimensions[i];
-
-  vector<int> mul_vector = mul_ret(dimensions);
-
-  vector<vector<int> > partitions;
-
-  for(int i=1; i<mul_vector.size(); i++)
-    partitions.push_back(partitioning(npp_arr_size, mul_vector[i]));
-
-  auto stop = high_resolution_clock::now();
-  auto duration = duration_cast<microseconds>(stop - start);
-
-  cout<<"Time taken for array creation and partition: "<<duration.count()<<endl;
-
-  vector<int>().swap(mul_vector);
-
-  vector<int> true_index;
-
-  int mode;
-
-  cout<<"Mode: ";
-  cin>>mode;
-
-  if(mode == 0) {
-    for(int idx=0; idx<npp_arr_size; idx++) {
-      cout<<idx<<"->";
-
-      for(int i=0; i<partitions.size(); i++) {
-        cout<<i<<endl;
-        if(i > 0) {
-          true_index.push_back(index(idx, partitions[i], dimensions[i]));
-        } else {
-          true_index.push_back(index(idx, partitions[i]));
-        }
-      }
-      cout<<true_index.size()<<endl;
-      for(int i=0; i<true_index.size(); i++)
-        cout<<true_index[i]<<" ";
-      cout<<endl;
-
-      true_index.clear();
-    }
-  } else {
-    int idx;
-    cout<<"Enter idx: ";
-    cin>>idx;
-
-    for(int i=0; i<partitions.size(); i++) {
-      if(i > 0) {
-        cout<<index(idx, partitions[i], dimensions[i])<<" ";
-      } else {
-        cout<<index(idx, partitions[i])<<" ";
-      }
-    }
-
-    for(int i=0; i<true_index.size(); i++)
-      cout<<true_index[i]<<" ";
-    cout<<endl;
-  }
-
-  return 0;
-}
diff --git a/src/old/compare.py b/src/old/compare.py
deleted file mode 100644
index bfdb0e3..0000000
--- a/src/old/compare.py
+++ /dev/null
@@ -1,12 +0,0 @@
-import numpy as np
-import time
-
-start = time.time()
-
-a = np.zeros([100, 100, 100, 100, 100])
-
-stop = time.time()
-
-print(stop - start)
-
-# 6000 times faster than serial numpp
diff --git a/src/old/numpp b/src/old/numpp
deleted file mode 100755
index 32b0cc7..0000000
Binary files a/src/old/numpp and /dev/null differ
diff --git a/src/old/numpp.cpp b/src/old/numpp.cpp
deleted file mode 100644
index f6ba324..0000000
--- a/src/old/numpp.cpp
+++ /dev/null
@@ -1,113 +0,0 @@
-#include <iostream>
-#include <vector>
-#include <sstream>
-#include <algorithm>
-#include <string>
-#include <iterator>
-
-#include <chrono>
-
-using namespace std;
-
-using namespace std::chrono;
-
-template <class T>
-class nparr {
-  private:
-    string dim;
-    vector<int> dimensions;
-    vector<vector<int> > partitions;
-
-    vector<int> split_string(string s) {
-      vector<int> ret_vec;
-      string buf = "";
-      int temp;
-      for(int i=0; i<s.length(); i++) {
-        if(s[i] == ',') {
-          stringstream int_str(buf);
-          int_str >> temp;
-          ret_vec.push_back(temp);
-          buf = "";
-          continue;
-        }
-        buf += s[i];
-      }
-
-      stringstream int_str(buf);
-      int_str >> temp;
-      ret_vec.push_back(temp);
-
-      return ret_vec;
-    }
-
-    vector<int> mul_ret(vector<int> dimensions) {
-
-      reverse(dimensions.begin(), dimensions.end());
-
-      vector<int> ret_arr;
-      int mul = 1;
-      for(int i=0; i<dimensions.size(); i++) {
-        mul *= dimensions[i];
-        ret_arr.push_back(mul);
-      }
-
-      reverse(ret_arr.begin(), ret_arr.end());
-
-      return ret_arr;
-    }
-
-    vector<int> partitioning(int size, int partition_size) {
-      vector<int> ret_vec;
-      for(int i=0; i<size; i++) {
-        if(i%partition_size == 0)
-          ret_vec.push_back(i);
-      }
-
-      return ret_vec;
-    }
-
-    int index(int idx, vector<int> row, int prev_dim=0) {
-      int ind=0;
-      int indexing;
-      for(int i=0; i<row.size(); i++) {
-        if(ind == prev_dim && prev_dim > 0)
-          ind = 0;
-        if(row[i] > idx) {
-          return indexing;
-        }
-        if(idx == row[i]) {
-          return ind;
-        }
-        indexing = ind;
-        ind++;
-      }
-      return ind-1;
-    }
-
-  public:
-    int npp_arr_size = 1;
-
-    nparr(string s) {
-      dim = s;
-
-      string::iterator end_pos = remove(dim.begin(), dim.end(), ' ');
-      dim.erase(end_pos, dim.end());
-
-      dimensions = split_string(dim);
-      dimensions.push_back(1);
-
-      for(int i=0; i<dimensions.size(); i++)
-        npp_arr_size *= dimensions[i];
-
-      vector<int> mul_vector = mul_ret(dimensions);
-
-      for(int i=1; i<mul_vector.size(); i++)
-        partitions.push_back(partitioning(npp_arr_size, mul_vector[i]));
-    }
-};
-
-int main() {
-  nparr<double> np("100, 100");
-
-  return 0;
-}
diff --git a/src/test.cpp b/src/test.cpp
index 5b36562..1deb96c 100644
--- a/src/test.cpp
+++ b/src/test.cpp
@@ -14,6 +14,22 @@ int main() {
   numpp<int> np({2, 2});
 
   auto start = high_resolution_clock::now();
+  
+  np.push_vec({2, 2}, {1, 2, 3, 4});
+  
+  cout<<np.max()<<endl;
+  cout<<np.min()<<endl;
+  auto stop = high_resolution_clock::now();
+  auto duration = duration_cast<nanoseconds>(stop - start);
+  
+  cout<<duration.count()<<endl;
+
+  np.shape();
+  cout<<endl;
+
+  np.zeros();
+  np.print();
+  auto start = high_resolution_clock::now();
 
   np.push_vec({2, 2}, {1, 2, 3, 4});