answersLogoWhite

0

hey lol booo

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What is algorithm to write algorithm to the program to access a pointer variable in structure?

Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield


Which algorithm is more efficient lamport bakery algorithm or black and white bakery algorithm?

Black and White bakery algorithm is more efficient.


What does industrial engineer do in banks?

The job of an industrial engineer is to figure out how to make things in the business better. Their job in the banking industry may be to develop a new loan system or come up with a new financial algorithm.


What is complsexity of an algorithm?

Complexity of an algorithm is a measure of how long an algorithm would take to complete given


List down the names of any three parameters on which you analyze an algorithm?

what is algorithm and its use there and analyze an algorithm


How algorithm is different from flowchart?

An algorithm is a series of steps leading to a result. A flowchart can be a graphical representation of the algorithm.


How do you test algorithm?

By preparing test cases we can test an algorithm. The algorithm is tested with each test case.


Define algorithm and explain its criteria?

algorithm criteria


How are expanded algorithm and the standard algorithm different?

Yes


What is algorithm evaluation?

evaluation iz same as the testing of an algorithm. it mainly refers to the finding of errors by processing an algorithm..


What is algorithm write properties of algorithm?

An ALGORITHM is a sequence of steps that depicts the program logic independent of the language in which it is to be implemented. An algorithm should be designed with space and time complexities in mind.


Is Dijkstra's algorithm a greedy algorithm?

Yes, Dijkstra's algorithm is a greedy algorithm because it makes decisions based on the current best option without considering future consequences.