newLinearDataStructure

nLDS

first self-directed project

for now, using C,,, using python or cc later if possible

코드의 주석은 주로 한국어 (comment in codes -> Korean)

---

develop Data Structure

1. Main
   • nLDS
   • ArrayList and LinkedList
2. Sub
   • BitList

---

ㅁ What

nLDS = Linked (List) + Array (List)

with the good points stated below,

without the so-so points stated below,

of course, nLDS should be no great waste of space

there is already good SkipList,,, but,,

ordinary,,

1. Linked list
   • good
     fast insert(at beginning, end)
     fast insert(at mid) (searchtime+O(1))
     fast resize (no copy)
   • so-so
     slow search(indexing)
     slow change(searchtime + O(1))
2. Array
   • good
     fast search(indexing)
     fast change item (indexing)
     fast insert(at end)
   • so-so
     slow insert(at beginning, middle)
     slow resize(O(n) copy)

---

ㅁ Process

1. make normal Linked List & Array List
2. make nLDS
3. test
4. compare
5. improve nLDS
6. and Repetition...

---

ㅁ How

preparing

---

ㅁ Test

preparing

---

ㅁ Environment

my Laptop

Windows 10

8GB RAM

Intel Core i7-4550U CPU

Visual Studio 2019, x64

Visual Studio Code

---