Merge branch 'main' of github.com:stoychoX/Data-structures-and-algorithms

1 files changed, 6 insertions, 6 deletions

diff --git a/Seminar06/Linked-List-Perm.cpp b/Seminar06/Linked-List-Palindrome.cpp
index ee2b1e4..8a627a9 100644
--- a/Seminar06/Linked-List-Perm.cpp
+++ b/Seminar06/Linked-List-Palindrome.cpp
@@ -1,28 +1,28 @@
 #include"../Seminar04/linked-list-utils.h"
 
-bool isLinkedListPermRec(const LinkedListNode<int>*& begin, const LinkedListNode<int>* end) {
+bool isLinkedListPalRec(const LinkedListNode<int>*& begin, const LinkedListNode<int>* end) {
     if(end == nullptr)
         return true;
 
-    bool res = isLinkedListPermRec(begin, end->next) && (begin->data == end->data);
+    bool res = isLinkedListPalRec(begin, end->next) && (begin->data == end->data);
 
     begin = begin->next;
     return res;
 }
 
 template<class T>
-bool isLinkedListPerm(const LinkedListNode<T>* ll) {
+bool isLinkedListPal(const LinkedListNode<T>* ll) {
     if(ll == nullptr)
         return true;
     
     const LinkedListNode<int>* begin = ll;
     const LinkedListNode<int>* end = ll;
     
-    return isLinkedListPermRec(begin, end);
+    return isLinkedListPalRec(begin, end);
 }
 
 int main() {
     LinkedListNode<int>* ll = new LinkedListNode(0, new LinkedListNode(1, new LinkedListNode(1)));
 
-    std::cout << isLinkedListPerm(ll);
-}
\ No newline at end of file
+    std::cout << isLinkedListPal(ll);
+}