Abstract
We are almost at the end of our journey. Assuming you have gone through all the chapters in this book, you will have seen many data structures and algorithms that you will encounter as a developer, builder, programmer, or whatever term you use to describe yourself. From this chapter onward, we will cover additional topics in DSA. Of course, there are more topics you may encounter, but with the foundation of knowledge you currently have, you should be able to understand them. In this chapter, we will briefly discuss randomness in computers. This topic is useful because often when designing your own algorithms, you may need to use random numbers for some purpose. There are even randomized algorithms that utilize the concept of randomness for their operation. This chapter helps you understand what is going on under the hood.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Armstrong Subero
About this chapter
Cite this chapter
Subero, A. (2020). Randomness. In: Codeless Data Structures and Algorithms . Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-5725-8_10
Download citation
DOI: https://doi.org/10.1007/978-1-4842-5725-8_10
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-5724-1
Online ISBN: 978-1-4842-5725-8
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)