Question

write algorithm for c program to delete an element from an array and shift the remaining elements​

Answer 1

Answer:

Delete an element from array (Using two traversals and one traversal)

Delete an element from array (Using two traversals and one traversal)Given an array and a number ‘x’, write a function to delete ‘x’ from the given array. We assume that array maintains two things with it, capacity and size. So when we remove an item, capacity does not change, only size changes.

Delete an element from array (Using two traversals and one traversal)Given an array and a number ‘x’, write a function to delete ‘x’ from the given array. We assume that array maintains two things with it, capacity and size. So when we remove an item, capacity does not change, only size changes.Example:

Delete an element from array (Using two traversals and one traversal)Given an array and a number ‘x’, write a function to delete ‘x’ from the given array. We assume that array maintains two things with it, capacity and size. So when we remove an item, capacity does not change, only size changes.Example:Input: arr[] = {3, 1, 2, 5, 90}, x = 2, size = 5, capacity = 5

Delete an element from array (Using two traversals and one traversal)Given an array and a number ‘x’, write a function to delete ‘x’ from the given array. We assume that array maintains two things with it, capacity and size. So when we remove an item, capacity does not change, only size changes.Example:Input: arr[] = {3, 1, 2, 5, 90}, x = 2, size = 5, capacity = 5Output: arr[] = {3, 1, 5, 90, _}, size = 4, capacity = 5

Delete an element from array (Using two traversals and one traversal)Given an array and a number ‘x’, write a function to delete ‘x’ from the given array. We assume that array maintains two things with it, capacity and size. So when we remove an item, capacity does not change, only size changes.Example:Input: arr[] = {3, 1, 2, 5, 90}, x = 2, size = 5, capacity = 5Output: arr[] = {3, 1, 5, 90, _}, size = 4, capacity = 5Input: arr[ ] = {3, 1, 2, _, _}, x = 2, size = 3, capacity = 5

] = {3, 1, 2, _, _}, x = 2, size = 3, capacity = 5Output: arr[ ] = {3, 1, _, _, _}, size = 4, capacity = 5

] = {3, 1, _, _, _}, size = 4, capacity = 5

] = {3, 1, _, _, _}, size = 4, capacity = 5 Method 1(First Search, then Remove)

] = {3, 1, _, _, _}, size = 4, capacity = 5 Method 1(First Search, then Remove)We first search ‘x’ in array, then elements that are on right side of x to one position back. The following are the implementation of this simple approach.

] = {3, 1, _, _, _}, size = 4, capacity = 5 Method 1(First Search, then Remove)We first search ‘x’ in array, then elements that are on right side of x to one position back. The following are the implementation of this simple approach.