Mikey's Tech Journey

   This week's resource article describes an algorithm as, "a procedure that you can write as a C function or program, or any other language. An algorithm states explicitly how the data will be manipulated." (Complexity Analysis, n.d.).    The length of time a program takes to complete a given task depends on its algorithm. The algorithm deals with how data is organized and how it is accessed. The biggest considerations for creating applications are time complexity and space complexity.     With time complexity, this refers to the number of operations needed and the time it takes it takes for them to run. This is typically measured in milliseconds. Operations are typically: 'compare', 'swap', 'fetch from memory' and 'send to memory'. While each operation takes only a small amount of time; the number of operations that are necessary grow exponentially. As the list of operations grows, so too does the time it takes for them to be enacted.    ...

 Hello World! I am back in the blogosphere after several months. The present course is called "Data Structures & Algorithms" and this week's focus is centered around installing Java and reviewing object-oriented design principles.  Thankfully the instructions embedded within the course made the installation of Java and IDE (integrated development environment) NetBeans seamless. The links provided to each website were straightforward (for the most part):  NetBeans (version 16):  https://netbeans.apache.org/download/index.html Java (version 19):  https://www.oracle.com/java/technologies/downloads/ The 4 major principles of Object-Oriented Programming:  1) Encapsulation - The hiding of data implementation by restricting access to accessors and mutators. The pieces that surround the data that forms the class. An Accessor is a method that is used to ask an object about itself (Lewallen, 2005). This is typically in the form of properties. Mutators are public...