title
Java Algorithms

description
Get the Code Here: http://goo.gl/2AJYt Support me on Patreon : https://www.patreon.com/derekbanas?ty=h MY UDEMY COURSES ARE 87.5% OFF TIL July 16th ($9.99) https://www.udemy.com/ ➡️ Python Data Science Series for $9.99 : Highest Rated & Largest Python Udemy Course + 56 Hrs + 200 Videos + Data Science https://bit.ly/Master_Python_35 ➡️ New C++ Programming Bootcamp Series for $9.99 : Over 23 Hrs + 53 Videos + Quizzes + Graded Assignments + New Videos Every Month https://bit.ly/C_Course_35 I LIVESTREAM CODE HERE : https://www.twitch.tv/derekbanas MY DISCORD : https://discord.gg/VckHCAvA ( Contact Me Anytime ) Welcome to my Java Algorithms tutorial. In this series I will cover everything there is to know about Java algorithms and data structures. An algorithm is just the steps you take to manipulate data. A data structure is the way data is arranged in memory. There are 3 main data structure operations I will focus on first being inserting, deleting and searching for data. Like all of my tutorials, everything is simple at first and then I cover more complex topics.

detail
{'title': 'Java Algorithms', 'heatmap': [{'end': 528.885, 'start': 516.381, 'weight': 0.752}, {'end': 660.197, 'start': 621.372, 'weight': 0.724}, {'end': 719.279, 'start': 704.111, 'weight': 0.802}], 'summary': '《java algorithms》 covers java algorithms, data structures, and multidimensional arrays, demonstrating array operations like insertion, deletion, and search. it also includes index manipulation, ascending and descending sorts, creating, manipulating arrays, generating random values, and performing linear search.', 'chapters': [{'end': 196.066, 'segs': [{'end': 58.29, 'src': 'embed', 'start': 0.109, 'weight': 0, 'content': [{'end': 3.633, 'text': 'Well hello internet and welcome to my Java algorithms tutorial.', 'start': 0.109, 'duration': 3.524}, {'end': 8.337, 'text': "Today I'm going to introduce you to both algorithms as well as data structures.", 'start': 3.693, 'duration': 4.644}, {'end': 14.163, 'text': "This tutorial is going to be heavy code wise and I'm going to present algorithms in numerous different ways.", 'start': 8.538, 'duration': 5.625}, {'end': 15.304, 'text': "So let's get into it.", 'start': 14.243, 'duration': 1.061}, {'end': 19.889, 'text': "So what exactly is an algorithm? It's just a series of steps you take to manipulate data.", 'start': 15.444, 'duration': 4.445}, {'end': 20.589, 'text': "That's it.", 'start': 20.089, 'duration': 0.5}, {'end': 21.81, 'text': "It's not that complicated.", 'start': 20.669, 'duration': 1.141}, {'end': 26.133, 'text': "So what are data structures? They're just a way that data is arranged in memory.", 'start': 22.03, 'duration': 4.103}, {'end': 33.597, 'text': "And today we're going to focus on the main data structure operations or algorithms that you're going to need to understand completely,", 'start': 26.313, 'duration': 7.284}, {'end': 38.64, 'text': 'being inserting values, deleting values and searching for values.', 'start': 33.597, 'duration': 5.043}, {'end': 41.041, 'text': 'And we are going to focus on arrays.', 'start': 39, 'duration': 2.041}, {'end': 48.446, 'text': "And I know everybody says they understand arrays, but I'm going to get into a question I get all of the time about multidimensional arrays.", 'start': 41.122, 'duration': 7.324}, {'end': 50.567, 'text': "But while I'm here, I might as well cover the basics.", 'start': 48.646, 'duration': 1.921}, {'end': 56.249, 'text': "Whenever we're going to create an array, of course, we're going to define how many boxes we want.", 'start': 50.767, 'duration': 5.482}, {'end': 58.29, 'text': 'And this is an array over here.', 'start': 56.59, 'duration': 1.7}], 'summary': 'Java algorithms tutorial covering data structures and array operations', 'duration': 58.181, 'max_score': 0.109, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw109.jpg'}, {'end': 201.633, 'src': 'embed', 'start': 176.601, 'weight': 6, 'content': [{'end': 183.349, 'text': "So now I'd like to jump over and look at a graphical program to show you all the different things we're going to cover in this tutorial.", 'start': 176.601, 'duration': 6.748}, {'end': 186.977, 'text': 'And I basically threw together this little program here.', 'start': 184.574, 'duration': 2.403}, {'end': 187.838, 'text': 'You can download it.', 'start': 187.017, 'duration': 0.821}, {'end': 196.066, 'text': "It's on a link underneath the video if you want to play around with arrays inside of this or see how a multi view controller sort of setup would work,", 'start': 187.878, 'duration': 8.188}, {'end': 197.888, 'text': "which I've also been getting a lot of questions on.", 'start': 196.066, 'duration': 1.822}, {'end': 201.633, 'text': "So what we're going to cover is how to delete indexes.", 'start': 198.129, 'duration': 3.504}], 'summary': 'Tutorial covers how to delete indexes in a graphical program.', 'duration': 25.032, 'max_score': 176.601, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw176601.jpg'}], 'start': 0.109, 'title': 'Java algorithms and multidimensional arrays', 'summary': 'Introduces algorithms and data structures in java, emphasizing array operations like insertion, deletion, and search, and also explains creating, initializing, and working with multidimensional arrays, along with a graphical program for further exploration.', 'chapters': [{'end': 41.041, 'start': 0.109, 'title': 'Java algorithms tutorial', 'summary': 'Introduces algorithms and data structures in java, focusing on array operations such as inserting, deleting, and searching for values.', 'duration': 40.932, 'highlights': ['The chapter introduces algorithms and data structures in Java, focusing on array operations such as inserting, deleting, and searching for values.', 'The tutorial will be heavy code-wise and will present algorithms in numerous ways.', 'An algorithm is defined as a series of steps to manipulate data, while data structures refer to the arrangement of data in memory.']}, {'end': 196.066, 'start': 41.122, 'title': 'Working with multidimensional arrays', 'summary': 'Explains the basics of creating and initializing arrays, then delves into the complexities of multidimensional arrays, demonstrating how to access specific values and the impact of increasing the number of dimensions, and concludes by offering a graphical program for further exploration.', 'duration': 154.944, 'highlights': ['The chapter explains the basics of creating and initializing arrays It covers the fundamentals of defining array size, initializing array values, and accessing elements by index.', 'Demonstrates the complexities of multidimensional arrays and accessing specific values It illustrates the concept of multidimensional arrays and accessing specific values using indexes, providing a clear understanding of the array structure.', 'Impact of increasing the number of dimensions in multidimensional arrays It demonstrates the impact of increasing the number of dimensions in a multidimensional array, providing a visual representation and explaining the changes in array structure and access patterns.', 'Concludes by offering a graphical program for further exploration It provides a graphical program for exploring arrays and multidimensional array structures, inviting further experimentation and understanding of the concepts discussed.']}], 'duration': 195.957, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw109.jpg', 'highlights': ['The chapter introduces algorithms and data structures in Java, focusing on array operations such as inserting, deleting, and searching for values.', 'The tutorial will be heavy code-wise and will present algorithms in numerous ways.', 'An algorithm is defined as a series of steps to manipulate data, while data structures refer to the arrangement of data in memory.', 'The chapter explains the basics of creating and initializing arrays It covers the fundamentals of defining array size, initializing array values, and accessing elements by index.', 'Demonstrates the complexities of multidimensional arrays and accessing specific values It illustrates the concept of multidimensional arrays and accessing specific values using indexes, providing a clear understanding of the array structure.', 'Impact of increasing the number of dimensions in multidimensional arrays It demonstrates the impact of increasing the number of dimensions in a multidimensional array, providing a visual representation and explaining the changes in array structure and access patterns.', 'Concludes by offering a graphical program for further exploration It provides a graphical program for exploring arrays and multidimensional array structures, inviting further experimentation and understanding of the concepts discussed.']}, {'end': 907.956, 'segs': [{'end': 278.643, 'src': 'embed', 'start': 236.828, 'weight': 0, 'content': [{'end': 237.469, 'text': 'No problem.', 'start': 236.828, 'duration': 0.641}, {'end': 239.71, 'text': 'Just put 16 inside of there for value.', 'start': 237.509, 'duration': 2.201}, {'end': 244.193, 'text': "And here we're going to do a linear search and click on find.", 'start': 239.95, 'duration': 4.243}, {'end': 248.636, 'text': 'And you can see that 16 shows up in index one, three and four.', 'start': 244.353, 'duration': 4.283}, {'end': 252.459, 'text': 'And in fact, one, three and four show up right like that.', 'start': 248.957, 'duration': 3.502}, {'end': 261.572, 'text': "We're also going to cover how to sort, both using ascending, sort, just like that, as well as descending, sort, just like that.", 'start': 252.719, 'duration': 8.853}, {'end': 265.818, 'text': "And we're going to do a whole bunch of other different things in this tutorial.", 'start': 261.911, 'duration': 3.907}, {'end': 267.56, 'text': "So let's just jump right into the code.", 'start': 265.978, 'duration': 1.582}, {'end': 274.101, 'text': 'Okay, so I basically have a class here called array structures, and all this code is available in the link underneath the video.', 'start': 268.499, 'duration': 5.602}, {'end': 278.643, 'text': "And I'm going to create a private integer array, and I'm going to call it the array.", 'start': 274.341, 'duration': 4.302}], 'summary': 'Demonstration of linear search, sorting, and other array operations using a class called array structures.', 'duration': 41.815, 'max_score': 236.828, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw236828.jpg'}, {'end': 553.861, 'src': 'heatmap', 'start': 516.381, 'weight': 3, 'content': [{'end': 518.361, 'text': "And then at the end, we're going to just return it.", 'start': 516.381, 'duration': 1.98}, {'end': 520.582, 'text': 'Do pretty much the same thing we had before.', 'start': 518.482, 'duration': 2.1}, {'end': 521.403, 'text': 'New array.', 'start': 520.803, 'duration': 0.6}, {'end': 525.444, 'text': "Does array contain this value? And then inside of it, we'll put 18.", 'start': 521.582, 'duration': 3.862}, {'end': 527.125, 'text': 'This is going to be a surprise for us all.', 'start': 525.444, 'duration': 1.681}, {'end': 528.885, 'text': 'Execute And false came up.', 'start': 527.225, 'duration': 1.66}, {'end': 530.626, 'text': "And we don't see 18 there.", 'start': 529.226, 'duration': 1.4}, {'end': 532.167, 'text': 'And that is a good thing.', 'start': 531.006, 'duration': 1.161}, {'end': 533.447, 'text': "So let's ratchet it up.", 'start': 532.307, 'duration': 1.14}, {'end': 535.109, 'text': 'Get a little bit more complicated.', 'start': 533.687, 'duration': 1.422}, {'end': 543.697, 'text': 'How are we going to go about deleting an index and then moving all the other values up? Little bit more complicated than before.', 'start': 535.269, 'duration': 8.428}, {'end': 547.021, 'text': "And let's look at briefly exactly what we're going to try to do here.", 'start': 543.897, 'duration': 3.124}, {'end': 553.861, 'text': "Okay, so we're going to have, like we have here, we have three boxes with values inside of them.", 'start': 548.217, 'duration': 5.644}], 'summary': 'Discussing array operations and value manipulation, aiming for complexity and problem-solving.', 'duration': 37.48, 'max_score': 516.381, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw516381.jpg'}, {'end': 660.197, 'src': 'heatmap', 'start': 621.372, 'weight': 0.724, 'content': [{'end': 629.256, 'text': "And then we're just going to simply say the array i is going to be equal to the array i plus one.", 'start': 621.372, 'duration': 7.884}, {'end': 635.5, 'text': "And that is going to move up those values and we're going to continue doing it until we get to the very end of the array.", 'start': 629.517, 'duration': 5.983}, {'end': 642.305, 'text': "And then after that, since we no longer have as many spaces in our array, we're going to decrement the array size.", 'start': 635.72, 'duration': 6.585}, {'end': 647.408, 'text': "So let's take a look at that new array, delete index, just like we saw before.", 'start': 642.485, 'duration': 4.923}, {'end': 649.71, 'text': "And let's say we want to delete index four.", 'start': 647.748, 'duration': 1.962}, {'end': 655.233, 'text': "And then let's say that we want to print out our array, just like we did before, file, save and execute.", 'start': 649.99, 'duration': 5.243}, {'end': 660.197, 'text': 'And there we can see index four is what we wanted to delete the value there was 18.', 'start': 655.433, 'duration': 4.764}], 'summary': 'The script demonstrates array manipulation and deletion, with index four being removed and the value 18 deleted.', 'duration': 38.825, 'max_score': 621.372, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw621372.jpg'}, {'end': 729.089, 'src': 'heatmap', 'start': 704.111, 'weight': 0.802, 'content': [{'end': 712.255, 'text': 'the reason why array size works there and not array size plus one is because of the zero index is going to be one less than what we actually have.', 'start': 704.111, 'duration': 8.144}, {'end': 716.317, 'text': 'And then of course, we can insert a value, new array, insert value.', 'start': 712.535, 'duration': 3.782}, {'end': 719.279, 'text': "And let's say that we want to put 55 inside of there.", 'start': 716.597, 'duration': 2.682}, {'end': 720.239, 'text': 'So it stands out.', 'start': 719.319, 'duration': 0.92}, {'end': 722.622, 'text': 'And then we can print our array and execute.', 'start': 720.499, 'duration': 2.123}, {'end': 725.766, 'text': 'And there you can see 55 is inside of there.', 'start': 722.742, 'duration': 3.024}, {'end': 729.089, 'text': "And the other reason why that's 9 is because we previously deleted it.", 'start': 725.946, 'duration': 3.143}], 'summary': 'Array size works, insert 55, print array, 55 is inside, 9 previously deleted', 'duration': 24.978, 'max_score': 704.111, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw704111.jpg'}, {'end': 907.956, 'src': 'embed', 'start': 864.738, 'weight': 1, 'content': [{'end': 870.659, 'text': "so let's see what it looks like when we execute a linear search for values, new array,", 'start': 864.738, 'duration': 5.921}, {'end': 878.024, 'text': "and then we're going to go and do linear search for value and i'm just going to put 17 inside of there and execute it and see what happens.", 'start': 870.659, 'duration': 7.365}, {'end': 883.134, 'text': 'And you can see here, the value was found in the following indexes, 5, 7, and 8.', 'start': 878.425, 'duration': 4.709}, {'end': 886.806, 'text': "And there's 8, 7, and 5.", 'start': 883.134, 'duration': 3.672}, {'end': 888.187, 'text': "So that's how a linear search works.", 'start': 886.806, 'duration': 1.381}, {'end': 891.808, 'text': "Well, I've covered a ton of different things in this tutorial.", 'start': 888.467, 'duration': 3.341}, {'end': 900.672, 'text': "In the next part of this tutorial, I'm going to show you how to use bubble sort to both sort in ascending and descending order and binary search,", 'start': 892.028, 'duration': 8.644}, {'end': 904.374, 'text': 'different ways to swap values and a whole bunch of other things.', 'start': 900.672, 'duration': 3.702}, {'end': 906.555, 'text': 'Please leave any questions or comments below.', 'start': 904.614, 'duration': 1.941}, {'end': 907.956, 'text': 'Otherwise, until next time.', 'start': 906.875, 'duration': 1.081}], 'summary': 'Linear search found value at indexes 5, 7, and 8.', 'duration': 43.218, 'max_score': 864.738, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw864738.jpg'}], 'start': 196.066, 'title': 'Index manipulation and array structures', 'summary': 'Covers how to delete and insert indexes, find specific values, and perform ascending and descending sorts in data. it also includes creating and manipulating arrays, generating random values, printing the array, getting and verifying array values, and performing linear search on the array.', 'chapters': [{'end': 261.572, 'start': 196.066, 'title': 'Index manipulation and sorting in data', 'summary': 'Covers how to delete and insert indexes, find specific values, and perform ascending and descending sorts, with examples such as deleting index 6, inserting value 23, finding all instances of 16, and demonstrating ascending and descending sorting.', 'duration': 65.506, 'highlights': ['The chapter covers how to delete and insert indexes, find specific values, and perform ascending and descending sorts.', 'Demonstrates deleting index 6 and seeing the subsequent reordering of indexes.', 'Shows the process of inserting a value, such as 23, and observing its placement in the data.', 'Covers finding specific values, exemplified by finding all instances of 16 using a linear search.', 'Explains how to perform ascending and descending sorts on the data.']}, {'end': 907.956, 'start': 261.911, 'title': 'Array structures tutorial', 'summary': 'Covers creating and manipulating arrays, including generating random values, printing the array, getting and verifying array values, deleting and inserting values, and performing linear search on the array.', 'duration': 646.045, 'highlights': ['Creating and manipulating arrays The tutorial covers creating a class for array structures, creating a private integer array, defining array size, generating random values, and printing the array.', 'Deleting and inserting values in the array The chapter explains the process of deleting an index and moving other values up, as well as inserting values at the end of the array, demonstrating the functionality with specific examples.', 'Performing linear search on the array The tutorial includes a demonstration of a linear search for a specific value in the array, returning the indexes where the value was found, and explaining the working of a linear search.']}], 'duration': 711.89, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/f5OD9CKrZEw/pics/f5OD9CKrZEw196066.jpg', 'highlights': ['Covers finding specific values, exemplified by finding all instances of 16 using a linear search.', 'Explains how to perform ascending and descending sorts on the data.', 'Creating a class for array structures, defining array size, generating random values, and printing the array.', 'Demonstrates the process of deleting an index and moving other values up, as well as inserting values at the end of the array.', 'Includes a demonstration of a linear search for a specific value in the array, returning the indexes where the value was found.']}], 'highlights': ['The chapter introduces algorithms and data structures in Java, focusing on array operations such as inserting, deleting, and searching for values.', 'Covers finding specific values, exemplified by finding all instances of 16 using a linear search.', 'Explains how to perform ascending and descending sorts on the data.', 'The tutorial will be heavy code-wise and will present algorithms in numerous ways.', 'An algorithm is defined as a series of steps to manipulate data, while data structures refer to the arrangement of data in memory.', 'Creating a class for array structures, defining array size, generating random values, and printing the array.', 'The chapter explains the basics of creating and initializing arrays It covers the fundamentals of defining array size, initializing array values, and accessing elements by index.', 'Demonstrates the process of deleting an index and moving other values up, as well as inserting values at the end of the array.', 'Demonstrates the complexities of multidimensional arrays and accessing specific values It illustrates the concept of multidimensional arrays and accessing specific values using indexes, providing a clear understanding of the array structure.', 'Includes a demonstration of a linear search for a specific value in the array, returning the indexes where the value was found.', 'Impact of increasing the number of dimensions in multidimensional arrays It demonstrates the impact of increasing the number of dimensions in a multidimensional array, providing a visual representation and explaining the changes in array structure and access patterns.', 'Concludes by offering a graphical program for further exploration It provides a graphical program for exploring arrays and multidimensional array structures, inviting further experimentation and understanding of the concepts discussed.']}