Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

learn to code C Programming | Mother language of Programming | Learn to code Easily

NotificationsYou must be signed in to change notification settings

ganeshkavhar/Data-Structure-in-C-Programming

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

image

The term data structure is used to describe the way data is stored, and the termalgorithm is used to describe the way data is processed. Data structures andalgorithms are interrelated. Choosing a data structure affects the kind of algorithmyou might use, and choosing an algorithm affects the data structures we use.

An Algorithm is a finite sequence of instructions, each of which has a clear meaningand can be performed with a finite amount of effort in a finite length of time. Nomatter what the input values may be, an algorithm terminates after executing afinite number of instructions.

Introduction to Data Structures:

Data structure is a representation of logical relationship existing between individual elements ofdata. In other words, a data structure defines a way of organizing all data items that considersnot only the elements stored but also their relationship to each other. The term data structureis used to describe the way data is stored.

To develop a program of an algorithm we should select an appropriate data structure for thatalgorithm. Therefore, data structure is represented as:

Algorithm + Data structure = Program

A data structure is said to be linear if its elements form a sequence or a linear list. The lineardata structures like an array, stacks, queues and linked lists organize data in linear order. Adata structure is said to be non linear if its elements form a hierarchical classification where,data items appear at various levels.

Trees and Graphs are widely used non-linear data structures. Tree and graph structuresrepresents hierarchial relationship between individual data elements. Graphs are nothing buttrees with certain restrictions removed.

Data structures are divided into two types:

Primitive data structures.

Primitive Data Structures are the basic data structures that directly operate upon themachine instructions. They have different representations on different computers. Integers,floating point numbers, character constants, string constants and pointers come under thiscategory.

Non-primitive data structures.

Non-primitive data structures are more complicated data structures and are derived fromprimitive data structures. They emphasize on grouping same or different data items withrelationship between each data item. Arrays, lists and files come under this category. Figure1.1 shows the classification of data structures.

About

learn to code C Programming | Mother language of Programming | Learn to code Easily

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages


[8]ページ先頭

©2009-2025 Movatter.jp