Answer Posted / prashant gupta

#include<stdio.h>
#include<conio.h>

void main()
{
int i,j,t;
int a[7]={5,7,8,1,4,2,9}; // You can use any length

for(i=0;i<6;i++)
{
for(j=i+1;j<6;j++)
{
if(a[i]>a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
printf("The Sorted Array is = %d",a[i]);

getch();
}

Can hashmap have same key?

861

---

What is tree in computer science?

969

---

What is definition list?

935

---

Which data structures are applied when dealing with a recursive function?

1132

---

Difference between calloc and malloc in data structures?

901

---

what is the difference between dynamic as well as non - dynamic data structures.

949

---

What is reduction to sorting method?

935

---

What is difference between map and hashmap?

1009

---

Can we add duplicate keys in a hashmap?

890

---

Define secondary clustering?

910

---

What are linked lists most commonly used for?

891

---

Define left-in threaded tree?

850

---

In which matrix, we can use multilinked structures?

889

---

Is bucket sort stable?

869

---

How do you replace an element in an arraylist?

993

---