Write an algorithm inputs speed of cars using pseudocode, Data Structure & Algorithms

Assignment Help:

Write an algorithm by using pseudocode which:

Inputs top speeds of 5000 cars
Outputs fastest speed and the slowest speed
Outputs average speed of all the 5000 cars

fastest = 0: count = 0

slowest = 1000

repeat

input top_speed

total = total + top_speed

if top_speed > fastest then fastest = top_speed

if top_speed < slowest then slowest = top_speed

endif

count + count + 1

until count = 5000

average = total * 100/5000

print fastest, slowest, average

Related Discussions:- Write an algorithm inputs speed of cars using pseudocode

Define about the class invariant, Define about the class invariant A cl...

Define about the class invariant A class invariant may not be true during execution of a public operation though it should be true between executions of public operations. For

User-specified memory location, You need to implement a function which will...

You need to implement a function which will write out a given user-specified memory location to disk in base 10. That means that you have to convert the large number data structure

Create algorithm for similarities between documents, Here is a diagram show...

Here is a diagram showing similarities between documents; this is an actual set of physics lab assignments from a large university. Each node (square) in the graph is a doc

Exlain double linked list, Double Linked List In a doubly linked list, ...

Double Linked List In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of t

Infix to postfix conversion, A(B+D)/E-F(G+H/K)

A*(B+D)/E-F*(G+H/K)

Sorting algorithm, Sorting Algorithm A sorting algorithm is an algorit...

Sorting Algorithm A sorting algorithm is an algorithm which puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Eff

Explain about the containers, Containers Introduction Simple abstr...

Containers Introduction Simple abstract data types are useful for manipulating simple sets of values, such as integers or real numbers however more complex abstract data t

Adjacency matrix, Q. Give the adjacency matrix for the graph drawn below: ...

Q. Give the adjacency matrix for the graph drawn below: Ans: Adjacency matrix for the graph given to us

Array implementation of a dequeue, If a Dequeue is implemented via arrays, ...

If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.

Applications in file systems of avl trees, 1. In computer science, a classi...

1. In computer science, a classic problem is how to dynamically store information so as to let for quick look up. This searching problem arises frequently in dictionaries, symbol t

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages