Website Summary Files Commits Branches @commit @diff @stats
path: root / Sem. 08 / task3.cpp
diff options
context:
space:
mode:
Commite2b836ad12d65354e77ae3b78428e4d3d73e2d4a (patch)
Author
 Angel Dimitriev <achi_d@abv.bg>
2020-12-10 10:46:29 -0500
Committer
 GitHub <noreply@github.com>
2020-12-10 10:46:29 -0500
Files3cf328069ed4e2f865cfe752f49059e2b68a0572 /Sem. 08/task3.cpp
Introduction_to_programming_FMI-e2b836ad12d65354e77ae3b78428e4d3d73e2d4a.tar
Introduction_to_programming_FMI-e2b836ad12d65354e77ae3b78428e4d3d73e2d4a.tar.gz
Introduction_to_programming_FMI-e2b836ad12d65354e77ae3b78428e4d3d73e2d4a.zip
Parent0f1c8ab705ff9132cb6eadff0f81598ce7db37a4 (diff)
Update task3.cpp
1 files changed, 2 insertions, 2 deletions
-rw-r--r--Sem. 08/task3.cpp4
diff --git a/Sem. 08/task3.cpp b/Sem. 08/task3.cpp
index 6d7d209..a6b0ca9 100644
--- a/Sem. 08/task3.cpp
+++ b/Sem. 08/task3.cpp
@@ -20,7 +20,7 @@ void print(int arr[SIZE])
cout << endl;
}
-int LongestPalindromicSubarray(int arr[SIZE], int n)
+int longestPalindromicSubarray(int arr[SIZE], int n)
{
int currentSize = n;
@@ -44,6 +44,6 @@ int main()
{
int arr[SIZE] = {1,4,3,2,3};
- cout << LongestPalindromicSubarray(arr, 5);
+ cout << longestPalindromicSubarray(arr, 5);
}