raghav1674 / DSA

datastructure implementation using python and cpp
2 stars 7 forks source link

Update README.md #5

Open raghav1674 opened 3 years ago

raghav1674 commented 3 years ago

Update README.md

Ayushchaudhary-Github commented 3 years ago

can you assign this to me. thanks

ashu-cybertron commented 3 years ago

this is a learning and educating project of the students, by the students, for the students.

DSA 💯

Built-in Data-structures: Lists: Stores indexed elements that are changeable and can contain duplicate items

Tuples: Stores indexed, unchangeable elements that can have duplicate copies

Dictionaries: Store key-value pairs that are changeable

Sets: Contains unordered, unique elements that are mutable

User-defined Data-structures: Arrays: Similar to Lists, but store single type of elements

Stack: Linear LIFO (Last-In-First-Out) Data structure

Queues: Linear FIFO (First-In-First-Out) data structure

Trees: Non-Linear data structures having a root and nodes

Linked Lists: Linear data structures that are linked with pointers

Graphs: Store a collection of points or nodes along with edges

Hash Maps: In Python, Hash Maps are the same as Dictionaries

This article on Data Structures and Algorithms in Python will require you to have prior knowledge about Data structures in Python. In case you do not have much idea about it, click here.

Algorithms:

What are Algorithms? Algorithms are rules or instructions that are formulated in a finite, sequential order to solve problems and get the required results. They give the pseudocode for problems and can be implemented in several languages as they are not language-specific.

Jibendu007 commented 3 years ago

@raghav1674 can i be assigned to this?

raghav1674 commented 3 years ago

@raghav1674 can i be assigned to this?

sure