Data structures and algorithms in Java, Part 2: One-dimensional arrays

An array is a fundamental data structure category, and a building block for more complex data structures. In this second tutorial in the data structures and algorithms series, you will learn how arrays are understood and used in Java programming. I’ll start with the concept of an array and how arrays are represented in the Java language. I’ll then introduce you to one-dimensional arrays and the three ways that you can use them in your Java programs. Finally, we’ll explore five algorithms used to search and sort one-dimensional arrays: Linear Search, Binary Search, Bubble Sort, Selection Sort, and Insertion Sort.

Note that this tutorial builds on Data structures and algorithms, Part 1, which introduced the theoretical side of data structures and the algorithms associated with them. That tutorial includes an in-depth discussion of algorithms and how to use space and time complexity factors to evaluate and select the most efficient algorithm for your Java program. We’ll get much more hands-on in this tutorial, because I assume you’ve already read Part 1.

To read this article in full, please click here