A data structure is the way you define a certain object in a program language. If you define a data structure for a contact in a contact list, you would have members of that data structure such as name, company, address, phone number, etc. The data structure is defined by what you need the program to keep track of.
An algorithm is a specific way of programming a task to make it work on the data you have. For example, there are many algorithms to sort data in a database of information. An algorithm is a specific way that the programmer writes a program to process the information. Algorithms are unique in the way that the program runs and can be measured by their efficiency in processing the data. The metrics are evaluated by how many computer instructions it takes to calculate the results
A data structure is the identification of how your program doesn't have a bugs, traffic, and errors.
An algorithm is a mathematical way of identifying how does it appears to be in a manner of linear and non-linear way of computation.
on the conclusion:
data structure is the flow of data identified on speed.
and
algorithm is the computation on the equalities and difference.
Wiki User
∙ 2011-09-13 15:27:43difference between serch data structure and allocation data structure
What is the difference between a data type and a data structure?"please send very soon within 1 day its very urgent.
The complexity of an algorithm is a function describing the efficiency of the algorithm in terms of the amount of data the algorithm must process
Data typing is static, but weakly enforced
data structure is a way of storing data in a computer so that it can be used efficientlyan algorithm is a sequence of instructions, often used for calculation and data processing.Often a carefully chosen data structure will allow the most efficient algorithm to be used.
difference between serch data structure and allocation data structure
What is the difference between a data type and a data structure?"please send very soon within 1 day its very urgent.
The complexity of an algorithm is a function describing the efficiency of the algorithm in terms of the amount of data the algorithm must process
Data typing is static, but weakly enforced
data structure is a way of storing data in a computer so that it can be used efficientlyan algorithm is a sequence of instructions, often used for calculation and data processing.Often a carefully chosen data structure will allow the most efficient algorithm to be used.
binary search
Data Mining in C++
The representation of a particular data structure in the memory of a computer is called a storage structure.
The algorithm to convert a forest tree into a binary tree in data structure can be quite long. You will need to start out with [head] and end with [finish].
the same difference there is between the design of a house and the elements used to build that design.
the way to access data
Structure is basicly a way of grouping servarl piece of information under a single name while Data structure menas with the orgnizing the data into a way by which it can be processed at any time and also concern with the realtionship of data,