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

Appearance settings

Nishtha35/Data-and-File-Structures

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
15 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data-and-File-Structures

DATA STRUCTURE: Structural representation of data items in primary memory to do storage & retrieval operations efficiently.
FILE STRUCTURE: Representation of items in secondary memory.

It includes

  1. Array
  2. Matrix
  3. Linked List
  4. Stack
  5. Queue
  6. Tree
  7. Heap
  8. Graph

This all includes searching and Sorting techniques codes.

Searching Techniques:

  1. Linear Search
  2. Binary Search

Sorting Techniques:
1. Bubble Sort
2. Selection Sort
3. Insertion Sort
4. Merge Sort
5. Quick Sort
6. Heap Sort
7. Radix Sort
8. Shell Soort
9. Counting Sort


All the codes are done using C
Morty Proxy This is a proxified and sanitized view of the page, visit original site.