LEADER 03872nam 2200457 450 001 9910153217503321 005 20170109010808.0 010 $a1-78646-416-0 035 $a(CKB)3710000000960500 035 $a(MiAaPQ)EBC4747073 035 $a(CaSebORM)9781786465153 035 $a(PPN)220202397 035 $a(EXLCZ)993710000000960500 100 $a20170228h20162016 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aR data structures and algorithms $eincrease speed and performance of your applications with efficient data structures and algorithms /$fDr. PKS Prakash, Achyutuni Sri Krishna Rao 205 $a1st edition 210 1$aBirmingham, England ;$aMumbai, [India] :$cPackt Publishing,$d2016. 210 4$dİ2016 215 $a1 online resource (266 pages) 300 $aIncludes index. 311 $a1-78646-515-9 330 $aIncrease speed and performance of your applications with efficient data structures and algorithms About This Book See how to use data structures such as arrays, stacks, trees, lists, and graphs through real-world examples Find out about important and advanced data structures such as searching and sorting algorithms Understand important concepts such as big-o notation, dynamic programming, and functional data structured Who This Book Is For This book is for R developers who want to use data structures efficiently. Basic knowledge of R is expected. What You Will Learn Understand the rationality behind data structures and algorithms Understand computation evaluation of a program featuring asymptotic and empirical algorithm analysis Get to know the fundamentals of arrays and linked-based data structures Analyze types of sorting algorithms Search algorithms along with hashing Understand linear and tree-based indexing Be able to implement a graph including topological sort, shortest path problem, and Prim's algorithm Understand dynamic programming (Knapsack) and randomized algorithms In Detail In this book, we cover not only classical data structures, but also functional data structures. We begin by answering the fundamental question: why data structures? We then move on to cover the relationship between data structures and algorithms, followed by an analysis and evaluation of algorithms. We introduce the fundamentals of data structures, such as lists, stacks, queues, and dictionaries, using real-world examples. We also cover topics such as indexing, sorting, and searching in depth. Later on, you will be exposed to advanced topics such as graph data structures, dynamic programming, and randomized algorithms. You will come to appreciate the intricacies of high performance and scalable programming using R. We also cover special R data structures such as vectors, data frames, and atomic vectors. With this easy-to-read book, you will be able to understand the power of linked lists, double linked lists, and circular linked lists. We will also explore the application of binary search and will go in depth into sorting algorithms such as bubble sort, selection sort, insertion sort, and merge sort. Style and approach This easy-to-read book with its fast-paced nature will improve the productivity of an R programmer and improve the performance of R applications. It is packed with real-world examples. 606 $aR (Computer program language) 606 $aData structures (Computer science) 615 0$aR (Computer program language) 615 0$aData structures (Computer science) 676 $a519.502855133 700 $aPrakash$b PKS$01234600 702 $aRao$b Achyutuni Sri Krishna 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910153217503321 996 $aR data structures and algorithms$92867901 997 $aUNINA