AlgoDS
-
GraphAlgoDS/DataStructure 2020. 1. 13. 01:18
1. Overview A Graph consists of a finite set of vertices(or nodes) and a set of edges that connect a pair of nodes. 2. Description 2.1 Components 2.1.1 Edge In the above Graph, the set of edges E = {(0,1), (1,2), (2,3), (3,4), (0,4), (1,4), (1,3)}. 2.1.2 Vertice In the above Graph, the set of vertices V = {0,1,2,3,4} 2.1.3 Adjacency matrix Represents graph with 'V' nodes into a VxV 0-1 matrix wh..
-
Choosing the appropriate Data StructureAlgoDS/DataStructure 2019. 9. 4. 21:14
1. Overview Data structures are the way to store and retrieve data like accessing data using an index in an array or a named key to store and retrieve information from a dictionary. Choosing the appropriate data structure enhancing inputting, processing, maintaining, retrieving information. For performance, the developer should choose the right data structure. 2. Description Data Structure Descr..
-
Searching and Sorting with ArrayAlgoDS/Algorithm 2019. 9. 4. 21:12
1. Overview Two array processing technique that are particularly common are searching and sorting. Searching here refers to finding an item in the array that meets some specified criterion. Sorting refers to rearranging all the items in the array into increasing or decreasing order. 2. Description Sorting Process Big O Selection Sort Find the smallest value in A and put it in A[0] Find the secon..
-
Merge SortAlgoDS/Algorithm 2019. 8. 31. 14:45
1. Overview Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides input array into two halves, calls itself for the two halves and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, l, m, r) is a key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one. See the following..