Algorithms and pseudocodes
Choose 2 sorting algorithms and 2 searching algorithms, and describe them in detail, including the type of data structures they work well with. Complete the following:
? For 1 of the selected search algorithms, write pseudocode, and create a flowchart to show how the algorithm could be implemented to search data in the data structure.
? For 1 of the selected sort algorithms, write pseudocode, and create a flowchart to show how the algorithm could be implemented to sort data in the data structure.
? Give the pseudocode and flowchart that would show how one of the additional data structures could be implemented to search data.
? In addition, create a flowchart to show how to sort using one of the additional algorithms.
o Give the pseudocode for the flowchart as well.
Please submit the following for your assignment in a single MS Word document:
? 2 flowcharts (1 for a searching algorithm and 1 for a sorting algorithm)
? 2 pseudocode examples (1 for a searching algorithm and 1 for a sorting algorithm)
Note: Diagrams created in separate programs should be copied and pasted into your document for submission.
Complete the following:
? Describe how arrays are implemented in Java.
? Provide Java code to illustrate how to create an array, reference an array, and address an element of an array.
? Create a flowchart and provide the corresponding pseudocode to show how to sort an array using the bubble sort.
? Create a flowchart and provide the corresponding pseudocode to show how to search an array for a specified value using the sequential search algorithm.
Complete the following:
? Create a flowchart to represent the Push and Pop operations for a Stack based on a linked list data structure.
? Create a flowchart to represent the Enqueue and Dequeue operations for a Queue based on a linked list data structure.
? Write the required Java code to implement either a Stack or a Queue data structure based on a linked list. The code should include the class constructors, the necessary properties, and methods to add and remove elements from the data structure. Do not use the built-in Java Stack class or the built-in Java Queue interface or the built-in Java linked list (you should create your own code for these classes).
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.Read more
Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.Read more
Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.Read more
Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.Read more
By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.Read more