### Unctions for doing sort, search, display, replace, delete

Assignment Help Data Structure & Algorithms
##### Reference no: EM13167990

create functions for doing sort, search, display, replace, delete, and add. You can use dynamic memory allocation for enlarge the size of pointer array for adding a new country.

#include<stdio.h>

int main()

{

inti;

char * country[5];

country[0]="India";

country[1]="America";

country[2]="China";

country[3]="Australia";

country[4]="England";

for(i=0;i<5;i++)

{

puts(country[i]);

}

}

India

America

China

Australia

England

Press any key to continue . . .

#### Draw the recursive process of mergesort and quicksort

Draw the recursive process of Mergesort and Quicksort for sorting the sequence {5, 1, 2, 9, 7}. You will get a recursion tree for Mergesort and Quicksort respectively. What ar

#### Describe an efficient erew algorithm to form a list

Consider an n-element list in an n-processor EREW parallel random-access machine, where some elements of the list are marked as being blue. Describe an efficient parallel al

#### Explain rijndael algorithm in some detail to your classmates

The Rijndael algorithm was chosen for the Advanced Encryption Standard (AES). Pick one (or more) steps of the algorithm and explain it in some detail to your classmates.

#### Divide-and-conquer two-dimensional closest-pair algorithm

consider the version of the divide-and-conquer two-dimensional closest-pair algorithm in which, instead of presorting input set P, we simply sort each of the two sets Pl and P

#### Boundary value analysis

Several functions have an almost infinite number of input values. Testing all of these values is not possible in most cases, and does not necessarily tell us more than testing

#### How to find the optimal pair of days i and j in time

In the solved exercise, we showed how to find the optimal pair of days i and j in time O(n log n). But, in fact, it's possible to do better than this. Show how to find the o

#### Describe idea of the algorithm using english language

Describe the overall idea of the algorithm using English language - Then present the algorithm details using pseudo code, be clear of the meaning of each variable, with comme

#### How theo peration were implemented for a regular linked list

In a doubly linked list, some of the operations require modification from how they were implemented for a regular linked list, because of the ____ pointer(s) in each node.