From fe639dedac35f2bb57227348e0e9c81e4ed886ea Mon Sep 17 00:00:00 2001
From: Prakhar Shreyash <64785098+prakharshreyash15@users.noreply.github.com>
Date: Fri, 9 Apr 2021 09:43:00 +0530
Subject: [PATCH 1/5] Added Array Declaration
---
2D_Array/readme.md | 4 ++++
1 file changed, 4 insertions(+)
diff --git a/2D_Array/readme.md b/2D_Array/readme.md
index c87880446..407883c5b 100644
--- a/2D_Array/readme.md
+++ b/2D_Array/readme.md
@@ -4,6 +4,10 @@
However, 2D arrays are created to implement a relational database look alike data structure. It provides ease of holding bulk of data at once which can be passed to any number of functions wherever required.
+## How to declare a 2D array?
+The syntax of declaring two dimensional array is very much similar to that of a one dimensional array, given as follows:-
+int arr[max_rows][max_columns];
+
## How do we access data in a 2D array
Due to the fact that the elements of 2D arrays can be random accessed. Similar to one dimensional arrays, we can access the individual cells in a 2D array by using the indices of the cells. There are two indices attached to a particular cell, one is its row number while the other is its column number.
From 6d0737152c9ebfb24495acefef159ba60f7b6688 Mon Sep 17 00:00:00 2001
From: Prakhar Shreyash <64785098+prakharshreyash15@users.noreply.github.com>
Date: Fri, 9 Apr 2021 09:55:58 +0530
Subject: [PATCH 2/5] Added Insertion at Start in C codes
---
Code/Insertion at start.c | 34 ++++++++++++++++++++++++++++++++++
1 file changed, 34 insertions(+)
create mode 100644 Code/Insertion at start.c
diff --git a/Code/Insertion at start.c b/Code/Insertion at start.c
new file mode 100644
index 000000000..d434b3cd7
--- /dev/null
+++ b/Code/Insertion at start.c
@@ -0,0 +1,34 @@
+#include <stdio.h>
+
+#define MAX 5
+
+void main() {
+ int array[MAX] = {2, 3, 4, 5};
+ int N = 4;
+ int i = 0;
+ int value = 1;
+
+ printf("Printing array before insertion −\n");
+
+ for(i = 0; i < N; i++) {
+ printf("array[%d] = %d \n", i, array[i]);
+ }
+
+
+ for(i = N; i >= 0; i--) {
+ array[i+1] = array[i];
+ }
+
+
+ array[0] = value;
+
+
+ N++;
+
+
+ printf("Printing array after insertion −\n");
+
+ for(i = 0; i < N; i++) {
+ printf("array[%d] = %d\n", i, array[i]);
+ }
+}
\ No newline at end of file
From d564e824dc57a6db329ac234171046dbfe861409 Mon Sep 17 00:00:00 2001
From: Prakhar Shreyash <64785098+prakharshreyash15@users.noreply.github.com>
Date: Fri, 9 Apr 2021 10:03:05 +0530
Subject: [PATCH 3/5] Added C
---
README.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/README.md b/README.md
index bb452cd42..0db4f09e4 100644
--- a/README.md
+++ b/README.md
@@ -11,7 +11,7 @@
[](https://github.com/Algo-Phantoms/Algo-Tree)
[](https://github.com/Algo-Phantoms/Algo-Tree)
-**Algo-Tree** is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as ``C++``, ``Python`` and ``Java``.
+**Algo-Tree** is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as ``C``, ``C++``, ``Python`` and ``Java``.
# Code Structure
* [Array](/Array)
From 2e0ece18b2860ded57d2c801affb97de972d4967 Mon Sep 17 00:00:00 2001
From: Prakhar Shreyash <64785098+prakharshreyash15@users.noreply.github.com>
Date: Sun, 23 May 2021 15:58:42 +0530
Subject: [PATCH 4/5] Added Longest Bitonic Subsequence using Python
---
Longest Bitonic Subsequence.py | 37 ++++++++++++++++++++++++++++++++++
1 file changed, 37 insertions(+)
create mode 100644 Longest Bitonic Subsequence.py
diff --git a/Longest Bitonic Subsequence.py b/Longest Bitonic Subsequence.py
new file mode 100644
index 000000000..183659c97
--- /dev/null
+++ b/Longest Bitonic Subsequence.py
@@ -0,0 +1,37 @@
+def calculateLBS(A):
+
+
+ I = [0] * len(A)
+
+
+ D = [0] * len(A)
+
+ n = len(A) - 1
+
+ I[0] = 1
+ for i in range(1, n + 1):
+ for j in range(i):
+ if A[j] < A[i] and I[j] > I[i]:
+ I[i] = I[j]
+ I[i] = I[i] + 1
+
+ D[n] = 1
+ for i in reversed(range(n)):
+ for j in range(n, i, -1):
+ if A[j] < A[i] and D[j] > D[i]:
+ D[i] = D[j]
+ D[i] = D[i] + 1
+
+
+ lbs = 1
+ for i in range(n + 1):
+ lbs = max(lbs, I[i] + D[i] - 1)
+
+ return lbs
+
+
+if __name__ == '__main__':
+
+ A = [4, 2, 4, 9, 7, 6, 14, 3, 3]
+
+ print("The length of the longest bitonic subsequence is", calculateLBS(A))
\ No newline at end of file
From fd738fcd1c6966821e6e0bf7f04a6d9674627719 Mon Sep 17 00:00:00 2001
From: Prakhar Shreyash <64785098+prakharshreyash15@users.noreply.github.com>
Date: Sun, 23 May 2021 16:01:53 +0530
Subject: [PATCH 5/5] Added Longest Bitonic Subsequence #1960