From edf3f3e33afb484518f1206bc955c31e575214dd Mon Sep 17 00:00:00 2001
From: K3v123 <123932560+K3v123@users.noreply.github.com>
Date: Sat, 6 Jan 2024 19:48:09 +1300
Subject: [PATCH] translation: Update index.md (#1009)

* Update index.md

improved the abstract.

* Update index.md

redid the sentences, if this one is no good then I will just use what Yuelinxin has provided me.
thanks and sorry for the inconvenience, also happy new year!

* Update index.md

deleted sinuous.
---
 docs-en/chapter_array_and_linkedlist/index.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/docs-en/chapter_array_and_linkedlist/index.md b/docs-en/chapter_array_and_linkedlist/index.md
index 838aebe05..b4aecaf4c 100644
--- a/docs-en/chapter_array_and_linkedlist/index.md
+++ b/docs-en/chapter_array_and_linkedlist/index.md
@@ -4,6 +4,6 @@
 
 !!! abstract
 
-    The world of data structures is like a solid brick wall.
+    The world of data structures resembles a sturdy brick wall.
 
-    The bricks of an array are neatly arranged, each closely connected to the next. In contrast, the bricks of a linked list are scattered, with vines of connections freely weaving through the gaps between bricks.
+    In arrays, envision bricks snugly aligned, each resting seamlessly beside the next, creating a unified formation. Meanwhile, in linked lists, these bricks disperse freely, embraced by vines gracefully knitting connections between them.