정보실

웹학교

정보실

javascript ES6를 사용한 데이터 구조 및 알고리즘

본문

ES6를 사용한 데이터 구조 및 알고리즘


https://github.com/Crizstian/data-structure-and-algorithms-with-ES6 


68747470733a2f2f692e626c6f67732e65732f3534356366382f6573362d6c6f676f2f6f726967696e616c2e706e67 68747470733a2f2f6c68332e676f6f676c6575736572636f6e74656e742e636f6d2f61345872632d386f514c7530356d4f724e507576415f6f326e5a4549456e4f6f54483477423931536c775f6843767549755f516769343430624b396d43386d6c2d4b413d77333030 


NumTypeExercisesDescription
1.-Array4The Array is the most common data structure in computer programming
2.-Lists5List is an ordered sequence of data, where elements are not meant to be ordered.
3.-Stacks3Stack is an example of Last-in, First-Out (LIFO)
4.-Queues2Queue is an example of First-in, First-Out (FIFO)
5.-Linked List 4Linked list is a collection of objects called nodes. Each node is linked to a successor node in the list using an object reference.
6.-Double Linked List 3Traversing a Double linked list are more efficient, since we no longer have to search for the previous node.
7.-Circular Linked List 4The reason you might want to create a Circular linked list is if you want the ability to go backward through a list but don’t want the extra overhead of creating a doubly linked list.
8.-Hashing2Hashing is a common technique for storing data in such a way that the data can be inserted and retrieved very quickly. Hashing uses a data structure called a hash table. Although hash tables provide fast insertion, deletion, and retrieval, they perform poorly for operations that involve searching.
9.-Binary Trees and Binary Search Trees4Binary trees are chosen over other more primary data structures because you can search a binary tree very quickly (as opposed to a linked list, for example) and you can quickly insert and delete data from a binary tree (as opposed to an array).
10.-Graph Data Structure2A graph consists of a set of vertices and a set of edges. A map is a type of graph where each town is a vertex, and a road that connects two towns is an edge. Edges are defined as a pair (v1, v2), where v1 and v2 are two vertices in a graph
11.-Sorting Algorithms6Two of the most common operations performed on data stored in a computer are sorting and searching.
12.-Searching Algorithms6There are two ways to search for data in a list: sequential search and binary search. A sequential search is used when the items in a list are in random order; a binary search is used when the items in a list are in sorted order.





  • 트위터로 보내기
  • 페이스북으로 보내기
  • 구글플러스로 보내기
  • 카카오톡으로 보내기

페이지 정보

조회 13회 ]  작성일19-11-01 22:40

웹학교