update

.config/Code/User/History/57a5bb02/4Amy.cpp

@@ -0,0 +1,61 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+
+        while(left < right){
+            mid = (left + right)/2
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/6Dfk.cpp

@@ -0,0 +1,74 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/6Wun.cpp

@@ -0,0 +1,48 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }       
+                }
+            }
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/6yaW.cpp

@@ -0,0 +1,50 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/8Qv9.cpp

@@ -0,0 +1,39 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/CmsQ.cpp

@@ -0,0 +1,81 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/FdKe.cpp

@@ -0,0 +1,73 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+
+    void addProduct(int sku){
+        if(i == 0) arr[i] = sku;
+        else{
+            
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/M7mz.cpp

@@ -0,0 +1,50 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/NtCt.cpp

@@ -0,0 +1,92 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/Ozqs.cpp

@@ -0,0 +1,51 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        if(i >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/P4kS.cpp

@@ -0,0 +1,64 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/POZd.cpp

@@ -0,0 +1,94 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left <= right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) left = mid+1;
+            else right = mid-1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    cout<<catalog.findProduct(10)<<endl;
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/QHws.cpp

@@ -0,0 +1,77 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/R6Cd.cpp

@@ -0,0 +1,81 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    
+                }
+            }
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/Sp8G.cpp

@@ -0,0 +1,70 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+
+    void addProduct(int sku){
+        
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/UKgh.cpp

@@ -0,0 +1,55 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+    int findProduct(int sku) const{
+        
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/UNjQ.cpp

@@ -0,0 +1,94 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    cout<<catalog.findProduct(10)<<endl;
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/UeWC.cpp

@@ -0,0 +1,72 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/Uu0Z.cpp

@@ -0,0 +1,86 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    break;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/VKSc.cpp

@@ -0,0 +1,48 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>j;k--){
+                        arr[k] = arr[k+1];
+                    }       
+                }
+            }
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/W2e9.cpp

@@ -0,0 +1,34 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(1), i(0), arr(new int[size]){}
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/WQWq.cpp

@@ -0,0 +1,85 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/c63b.cpp

@@ -0,0 +1,94 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left <= right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    cout<<catalog.findProduct(2)<<endl;
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/dPuS.cpp

@@ -0,0 +1,94 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i-1;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    cout<<catalog.findProduct(10)<<endl;
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/eDIm.cpp

@@ -0,0 +1,87 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    break;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/eJKH.cpp

@@ -0,0 +1,23 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/entries.json

@@ -0,0 +1 @@
+{"version":1,"resource":"file:///home/rafayahmad/Stuff/Coding/C%2B%2B/DS/lab2/task3.cpp","entries":[{"id":"eJKH.cpp","timestamp":1725274553810},{"id":"W2e9.cpp","timestamp":1725274590443},{"id":"nBH4.cpp","timestamp":1725274628940},{"id":"rj3R.cpp","timestamp":1725274723458},{"id":"8Qv9.cpp","timestamp":1725274782798},{"id":"phtQ.cpp","timestamp":1725274795015},{"id":"i7ZT.cpp","timestamp":1725274807722},{"id":"oafq.cpp","timestamp":1725274857355},{"id":"fYMH.cpp","timestamp":1725275596857},{"id":"VKSc.cpp","timestamp":1725275675684},{"id":"6Wun.cpp","timestamp":1725275691128},{"id":"M7mz.cpp","timestamp":1725275715781},{"id":"6yaW.cpp","timestamp":1725275819965},{"id":"Ozqs.cpp","timestamp":1725275895796},{"id":"qlm8.cpp","timestamp":1725275972303},{"id":"UKgh.cpp","timestamp":1725276079311},{"id":"4Amy.cpp","timestamp":1725276124628},{"id":"P4kS.cpp","timestamp":1725276182521},{"id":"UeWC.cpp","timestamp":1725276222214},{"id":"tg49.cpp","timestamp":1725276266458},{"id":"CmsQ.cpp","timestamp":1725276424280},{"id":"wWIG.cpp","timestamp":1725277292073},{"id":"Sp8G.cpp","timestamp":1725277313977},{"id":"FdKe.cpp","timestamp":1725277340606},{"id":"6Dfk.cpp","timestamp":1725277373259},{"id":"QHws.cpp","timestamp":1725277544395},{"id":"R6Cd.cpp","timestamp":1725277608997},{"id":"rNNQ.cpp","timestamp":1725277667460},{"id":"WQWq.cpp","timestamp":1725277739880},{"id":"ysO2.cpp","timestamp":1725277820123},{"id":"mrkr.cpp","timestamp":1725277882232},{"id":"rEd2.cpp","timestamp":1725277894069},{"id":"jFUa.cpp","timestamp":1725277974209},{"id":"Uu0Z.cpp","timestamp":1725278068535},{"id":"eDIm.cpp","timestamp":1725278101778},{"id":"NtCt.cpp","timestamp":1725278189404},{"id":"ghpk.cpp","timestamp":1725278239014},{"id":"UNjQ.cpp","timestamp":1725278254984},{"id":"dPuS.cpp","timestamp":1725278282467},{"id":"rabZ.cpp","timestamp":1725278295861},{"id":"omvN.cpp","timestamp":1725278309807},{"id":"llnN.cpp","timestamp":1725278336421},{"id":"c63b.cpp","timestamp":1725278374407},{"id":"POZd.cpp","timestamp":1725278421404}]}

.config/Code/User/History/57a5bb02/fYMH.cpp

@@ -0,0 +1,46 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                           
+                }
+            }
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/ghpk.cpp

@@ -0,0 +1,94 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    cout<<catalog.findProduct(5)<<endl;
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/i7ZT.cpp

@@ -0,0 +1,41 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        for(int j=0;j<i;j++){
+            
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/jFUa.cpp

@@ -0,0 +1,85 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/llnN.cpp

@@ -0,0 +1,94 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left <= right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    cout<<catalog.findProduct(10)<<endl;
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/mrkr.cpp

@@ -0,0 +1,85 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/nBH4.cpp

@@ -0,0 +1,34 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/oafq.cpp

@@ -0,0 +1,43 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        for(int j=0;j<i;j++){
+            if(arr[j] > sku){
+                
+            }
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/omvN.cpp

@@ -0,0 +1,94 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = left - (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    cout<<catalog.findProduct(10)<<endl;
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/phtQ.cpp

@@ -0,0 +1,39 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/qlm8.cpp

@@ -0,0 +1,51 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/rEd2.cpp

@@ -0,0 +1,85 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/rNNQ.cpp

@@ -0,0 +1,85 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;
+                    i++;
+                }
+            }
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/rabZ.cpp

@@ -0,0 +1,94 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        bool flag = true;
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i-1;k>=j;k--){
+                        arr[k+1] = arr[k];
+                    }
+                    arr[j] = sku;
+                    flag = false;
+                    break;
+                }
+            }
+            if(flag){
+                arr[i] = sku;
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(8);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    cout<<catalog.findProduct(10)<<endl;
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/rj3R.cpp

@@ -0,0 +1,38 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void add(int sku){
+        
+    }
+};
+
+
+
+int main(){
+
+    
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/tg49.cpp

@@ -0,0 +1,80 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0), arr(new int[size]){}
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/wWIG.cpp

@@ -0,0 +1,83 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>=j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;       
+                    break;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}

.config/Code/User/History/57a5bb02/ysO2.cpp

@@ -0,0 +1,85 @@
+/*
+Rafay Ahmad
+23I-2526
+*/
+#include <iostream>
+using namespace std;
+
+class SortedCatalog{
+    int* arr;
+    int size;
+    int i;
+
+    void increaseCapacity(){
+        int* newArr = new int[size*2];
+        for(int j=0;j<size;j++){
+            newArr[j] = arr[j];
+        }
+        delete arr;
+        arr = newArr;
+        size *= 2;
+    }
+
+public:
+    SortedCatalog() : size(10), i(0){
+        arr = new int[size];
+    }
+    ~SortedCatalog(){
+        delete[] arr;
+    }
+
+    void addProduct(int sku){
+        if(i+1 >= size) increaseCapacity();
+        if(i == 0) arr[i] = sku;
+        else{
+            for(int j=0;j<i;j++){
+                if(arr[j] > sku){
+                    for(int k=i;k>j;k--){
+                        arr[k] = arr[k+1];
+                    }
+                    arr[j] = sku;
+                }
+            }
+        }
+        i++;
+    }
+
+    int findProduct(int sku) const{
+        int left = 0;
+        int right = i;
+        int mid;
+        while(left < right){
+            mid = (left + right)/2;
+            if(arr[mid] == sku) return mid;
+            else if(arr[mid] < sku) right = mid-1;
+            else left = mid+1;
+        }
+        return -1;
+    }
+
+    void printCatalog() const{
+        for(int j=0;j<i;j++){
+            cout<<arr[j]<<" ";
+        }
+        cout<<endl;
+    }
+
+
+};
+
+
+
+int main(){
+
+    SortedCatalog catalog;
+
+    catalog.addProduct(5);
+    catalog.addProduct(3);
+    catalog.addProduct(2);
+    catalog.addProduct(10);
+
+    catalog.printCatalog();
+
+
+    return 0;
+}