Data structures assignment

User Generated

tneyvpcbjqrevfyvsr

Computer Science

Description

There are many additional algorithms available for searching and sorting data structures. The searching and sorting algorithms that are typically used work best for particular data structures. For this assignment, you will examine 2 searching algorithms and 2 sorting algorithms and the associated data structures.

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.
    • 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)

User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

Attached.

Running head: DATA STRUCTURES

1

Data Structures Assignment

Course number and name

Student name

Date

SORTING AND SEARCHING ALGORITHMS

2

Selection sort algorithm
Description Selection sort algorithm
Basically. Selection sort compares first two elements of an array list by swapping if needed. The route
continues until first, and last value of the array comparison ends. These complete the first process of
selection sort algorithm. The array list is divided by an imaginary wall into two sublists, sorted and
unsorted, Then we get the smallest value from unsorted sublist then swap the value to the 0 index in
unsorted data sublist. When selection and swapping, the imaginary wall between the two sublists m...


Anonymous
Just the thing I needed, saved me a lot of time.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Similar Content

Related Tags