## Similar to Data structure.pptx

6_Array.pptx
6_Array.pptx
shafat6712

C programs
C programs
Koshy Geoji

Arrays 06.ppt
Arrays 06.ppt
ahtishamtariq511

DSC program.pdf
DSC program.pdf

2DArrays.ppt
2DArrays.ppt
Nooryaseen9

DAA Lab Work.docx
DAA Lab Work.docx
Deepusri2000Srivasta

Sorting and Searching in Array.pptx
Sorting and Searching in Array.pptx

1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
rushabhshah600

Chapter 6 arrays part-1
Chapter 6 arrays part-1
Synapseindiappsdevelopment

Heap sort &amp; bubble sort
Heap sort &amp; bubble sort
Shanmuga Raju

DSA - Array.pptx
DSA - Array.pptx
11STEM2PGROUP1

Write a program that obtains the execution time of selection sort, bu.pdf
Write a program that obtains the execution time of selection sort, bu.pdf
arri2009av

Java căn bản - Chapter10
Java căn bản - Chapter10
Vince Vo

design and analysis of algorithm Lab files
design and analysis of algorithm Lab files
Nitesh Dubey

Write a program to implement and test the following sorting algorithm.docx
Write a program to implement and test the following sorting algorithm.docx
ajoy21

Arrays
week-20x
Data Structures Using C Practical File
Data Structures Using C Practical File
Rahul Chugh

ch07-arrays.ppt
ch07-arrays.ppt
Mahyuddin8

Kumar Gaurav

### Similar to Data structure.pptx(20)

6_Array.pptx
6_Array.pptx

C programs
C programs

Arrays 06.ppt
Arrays 06.ppt

DSC program.pdf
DSC program.pdf

2DArrays.ppt
2DArrays.ppt

DAA Lab Work.docx
DAA Lab Work.docx

Sorting and Searching in Array.pptx
Sorting and Searching in Array.pptx

1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf

Chapter 6 arrays part-1
Chapter 6 arrays part-1

Heap sort &amp; bubble sort
Heap sort &amp; bubble sort

DSA - Array.pptx
DSA - Array.pptx

Write a program that obtains the execution time of selection sort, bu.pdf
Write a program that obtains the execution time of selection sort, bu.pdf

Java căn bản - Chapter10
Java căn bản - Chapter10

design and analysis of algorithm Lab files
design and analysis of algorithm Lab files

Write a program to implement and test the following sorting algorithm.docx
Write a program to implement and test the following sorting algorithm.docx

Arrays
Arrays

week-20x
week-20x

Data Structures Using C Practical File
Data Structures Using C Practical File

ch07-arrays.ppt
ch07-arrays.ppt

## More from SajalFayyaz

Data structure.ppt
Data structure.ppt
SajalFayyaz

data structure 9.pptx
data structure 9.pptx
SajalFayyaz

Data structure 8.pptx
Data structure 8.pptx
SajalFayyaz

Data structure.pptx
Data structure.pptx
SajalFayyaz

Data structure 6.pptx
Data structure 6.pptx
SajalFayyaz

Data Structure.pptx
Data Structure.pptx
SajalFayyaz

Data structure.pptx
Data structure.pptx
SajalFayyaz

data structure3.pptx
data structure3.pptx
SajalFayyaz

Data structure.pptx
Data structure.pptx
SajalFayyaz

Data Structure.pptx
Data Structure.pptx
SajalFayyaz

### More from SajalFayyaz(10)

Data structure.ppt
Data structure.ppt

data structure 9.pptx
data structure 9.pptx

Data structure 8.pptx
Data structure 8.pptx

Data structure.pptx
Data structure.pptx

Data structure 6.pptx
Data structure 6.pptx

Data Structure.pptx
Data Structure.pptx

Data structure.pptx
Data structure.pptx

data structure3.pptx
data structure3.pptx

Data structure.pptx
Data structure.pptx

Data Structure.pptx
Data Structure.pptx

STATATHON: Unleashing the Power of Statistics in a 48-Hour Knowledge Extravag...
STATATHON: Unleashing the Power of Statistics in a 48-Hour Knowledge Extravag...
sameer shah

Palo Alto Cortex XDR presentation .......
Palo Alto Cortex XDR presentation .......
Sachin Paul

Everything you wanted to know about LIHTC
Everything you wanted to know about LIHTC
Roger Valdez

nyfuhyz

74nqk8xf

A presentation that explain the Power BI Licensing
A presentation that explain the Power BI Licensing
AlessioFois2

Learn SQL from basic queries to Advance queries
Learn SQL from basic queries to Advance queries
manishkhaire30

DSSML24_tspann_CodelessGenerativeAIPipelines
DSSML24_tspann_CodelessGenerativeAIPipelines
Timothy Spann

Udemy_2024_Global_Learning_Skills_Trends_Report (1).pdf
Udemy_2024_Global_Learning_Skills_Trends_Report (1).pdf
Fernanda Palhano

zsjl4mimo

My burning issue is homelessness K.C.M.O.
My burning issue is homelessness K.C.M.O.
rwarrenll

g4dpvqap0

ViewShift: Hassle-free Dynamic Policy Enforcement for Every Data Lake
ViewShift: Hassle-free Dynamic Policy Enforcement for Every Data Lake
Walaa Eldin Moustafa

74nqk8xf

Experts live - Improving user adoption with AI
Experts live - Improving user adoption with AI
jitskeb

University of New South Wales degree offer diploma Transcript
University of New South Wales degree offer diploma Transcript
soxrziqu

The Building Blocks of QuestDB, a Time Series Database
The Building Blocks of QuestDB, a Time Series Database
javier ramirez

4th Modern Marketing Reckoner by MMA Global India & Group M: 60+ experts on W...
4th Modern Marketing Reckoner by MMA Global India & Group M: 60+ experts on W...
Social Samosa

aqzctr7x

06-04-2024 - NYC Tech Week - Discussion on Vector Databases, Unstructured Dat...
06-04-2024 - NYC Tech Week - Discussion on Vector Databases, Unstructured Dat...
Timothy Spann

STATATHON: Unleashing the Power of Statistics in a 48-Hour Knowledge Extravag...
STATATHON: Unleashing the Power of Statistics in a 48-Hour Knowledge Extravag...

Palo Alto Cortex XDR presentation .......
Palo Alto Cortex XDR presentation .......

Everything you wanted to know about LIHTC
Everything you wanted to know about LIHTC

A presentation that explain the Power BI Licensing
A presentation that explain the Power BI Licensing

Learn SQL from basic queries to Advance queries
Learn SQL from basic queries to Advance queries

DSSML24_tspann_CodelessGenerativeAIPipelines
DSSML24_tspann_CodelessGenerativeAIPipelines

Udemy_2024_Global_Learning_Skills_Trends_Report (1).pdf
Udemy_2024_Global_Learning_Skills_Trends_Report (1).pdf

My burning issue is homelessness K.C.M.O.
My burning issue is homelessness K.C.M.O.

ViewShift: Hassle-free Dynamic Policy Enforcement for Every Data Lake
ViewShift: Hassle-free Dynamic Policy Enforcement for Every Data Lake

Experts live - Improving user adoption with AI
Experts live - Improving user adoption with AI

University of New South Wales degree offer diploma Transcript
University of New South Wales degree offer diploma Transcript

The Building Blocks of QuestDB, a Time Series Database
The Building Blocks of QuestDB, a Time Series Database

4th Modern Marketing Reckoner by MMA Global India & Group M: 60+ experts on W...
4th Modern Marketing Reckoner by MMA Global India & Group M: 60+ experts on W...

06-04-2024 - NYC Tech Week - Discussion on Vector Databases, Unstructured Dat...
06-04-2024 - NYC Tech Week - Discussion on Vector Databases, Unstructured Dat...

### Data structure.pptx

• 1.
• 2.
• 3.
• 4.
• 5.
• 6.
• 7.
• 8.
• 9.
• 10.
• 11.
• 12.
• 13.
• 14.
• 15.
• 16.
• 17.
• 18.
• 19.
• 20.
• 21.
• 22.
• 23.
• 24.
• 25.
• 26.
• 27.
• 28.
• 29.
• 30.
• 31.
• 32.
• 33.
• 34.
• 35.
• 36.
• 37.
• 38.
• 39.
• 40.
• 41.
• 42.
• 43.
• 44. 1.int main() { 2. int a[] = {181, 289, 390, 121, 145, 736, 514, 888, 122}; 3. int n = sizeof(a) / sizeof(a[0]); 4. printf("Before sorting array elements are - n"); 5. printArray(a,n); 6. radixsort(a, n); 7. printf("After applying Radix sort, the array elements are - n"); 8. printArray(a, n); 9.}
• 45. 1.#include <stdio.h> 2. 3.int getMax(int a[], int n) { 4. int max = a[0]; 5. for(int i = 1; i<n; i++) { 6. if(a[i] > max) 7. max = a[i]; 8. } } return max; //maximum element from the array }
• 46. 1.void countingSort(int a[], int n, int place) // function t implement counting sor t 2.{ 3. int output[n + 1]; 4. int count[10] = {0}; 5. 6. // Calculate count of elements 7. for (int i = 0; i < n; i++) 8. count[(a[i] / place) % 10]++; 9. 10. // Calculate cumulative frequency 11. for (int i = 1; i < 10; i++) 12. count[i] += count[i - 1]; 13. 14. // Place the elements in sorted order 15. for (int i = n - 1; i >= 0; i--) { 16. output[count[(a[i] / place) % 10] - 1] = a[i]; 17. count[(a[i] / place) % 10]--; 18. } 19. 20. for (int i = 0; i < n; i++) 21. a[i] = output[i]; }
• 47. 1.// function to implement radix sort 2.void radixsort(int a[], int n) { 3. 4. // get maximum element from array 5. int max = getMax(a, n); 6. 7. // Apply counting sort to sort eleme nts based on place value 8. for (int place = 1; max / place > 0; place *= 10) 9. countingSort(a, n, place); }
• 48. 1.// function to print array elements 2.void printArray(int a[], int n) { 3. for (int i = 0; i < n; ++i) { 4. printf("%d ", a[i]); 5. } 6. printf("n"); 7.}
Current LanguageEnglish
Español
Portugues
Français
Deutsche