diff options
| Commit | 84e86c5d4cbe0215635461c5a0c08bb7c87b599e (patch) | |
|---|---|---|
| Author | 2022-12-25 18:47:17 +0200 | |
| Committer | 2022-12-25 18:47:17 +0200 | |
| Files | c397bfd7f79316f8dd2f2dc9564e7827cceb437d /Seminar04/README.md | |
| Data-structures-and-algorithms-main.tar Data-structures-and-algorithms-main.tar.gz Data-structures-and-algorithms-main.zip | ||
| Parent | f545af9286e273e4a2be26d2111bf9ca6b4faaf6 (diff) | |
1 files changed, 2 insertions, 0 deletions
| -rw-r--r-- | Seminar04/README.md | 2 |
diff --git a/Seminar04/README.md b/Seminar04/README.md index 50518a3..eb35f37 100644 --- a/Seminar04/README.md +++ b/Seminar04/README.md @@ -187,9 +187,11 @@ LL = 5 -> 4 -> 3 -> 2 -> 1 Да се напише функция, която открива средата на свързан списък. Пример: +``` 1 -> 2 -> 3 -> 4 -> 5 => 3 1 -> 2 -> 3 -> 4 => 3 +``` ## Задача четвърта да се напише функция която пренарежда свързания списък по следния начин: |