Searching and Sorting Algorithms

Question 1

What is an algorithm?

Answer 1

An algorithm is a series of steps that leads to a solution/desired output

Question 2

What are the characteristics of an algorithm?

Answer 2

The Characteristics of an algorithm are:
Output - The values produced as a result
Clarity - The clarity of the code and if the computer is able to understand it
Efficiency - If the code is efficient and works well. The code must be basic.
Input - Values entered by the coder/user that helps up get to our desired output
Finiteness - If the code stops after finding the desired output.

Question 3

How many types of searching techniques are there and what are they?

Answer 3

There are two types of searching techniques:

Linear Search and Binary Search

Question 4

What is another name of linear search?

Answer 4

Another name of linear search is sequential search

Question 5

What is linear search?

Answer 5

Linear search is a simple algorithm. For linear search, we need a set of data and in that set of data a value to be found. This algorithm will search through each element of the data and will give you the value to be found as an output. The search stops after the desired output is found.

Question 6

What are the advantages of linear search?

Answer 6

The advantages of linear search are that we can find our desired value in a set of data. Linear search is simple and basic,

Question 7

What are the disadvantages of linear search?

Answer 7

The disadvantage of linear search is that in a set with a lot of data, it is hard to find the desired output. In a big set if the linear search is used it would consume a lot of time.

Question 8

What is sorting?

Answer 8

Sorting is the process in which elements of the data are sorted into ascending/descending order or an order decided by the user.

Question 9

What are the two types of sorting? Explain both of them.

Answer 9

The two types of sorting are:
Internal Sorting - In this sorting the primary memory is used to store the data
External sorting - In this sorting, there is usually a large amount of data. Because of this, secondary memory is used.

Question 10

What is bubble sort? Explain

Answer 10

Bubble sort is a sorting algorithm in which two neighbouring elements are compared and are sorted into ascending/descending order. All elements of the set are sorted and once the set is in an ascending/descending order the new set is displayed as an output.

Question 11

What are the steps of bubble sort called?

Answer 11

The steps of bubble sort are called passes.