Data Structure

What is Data Structure ?

Data Structure may be a thanks to store and organize data in order that it are often used efficiently.
Our arrangement tutorial includes all topics of knowledge Structure like Array, Pointer, Structure, Linked List, Stack, Queue, Graph, Searching, Sorting, Programs, etc.

Types of Data Structure

There are two types of Data Structure.
    - Primitive Data Structure 

    - Non-Primitive Data Structure 

Primitive Data Structure 

- The primitive data structures are primitive data types. The int, char, float, double, and pointer are the primitive data structures which will hold one value.

Non-Primitive Data Structure 

The Non-Primitive Data Structure divided into two types.

    - Linear Data Structure 

    - Non - Linear Data Structure 


List Of Algorithm






Comments

Post a Comment

Popular posts from this blog

Brent's Algorithm

Image
Brent's Cycle detection Algorithm Given a linked list, check if the linked list has loop or not. Below diagram shows a linked list with a loop.   Brent’s cycle detection algorithm is analogous to Floyd's algorithm because it also uses two pointer technique. But there's some difference in their approaches. Here we make one pointer stationary till every iteration and teleport it to other pointer at every power of two. the beginning of the cycle is decided by the littlest power of two at which they meet. This improves upon the constant factor of Floyd’s algorithm by reducing the amount of calls. Move fast pointer (or second_pointer) in powers of two until we discover a loop. After every power, we reset slow pointer (or first_pointer) to previous value of second pointer. Reset length to 0 after every every power. The condition for loop testing is first_pointer and second_pointer become same. And loop isn't present if second_pointer becomes NULL. The condition for loop test...
Read more