{"id":26677,"date":"2017-09-06T00:22:40","date_gmt":"2017-09-05T18:52:40","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26677"},"modified":"2017-09-06T00:22:40","modified_gmt":"2017-09-05T18:52:40","slug":"search-insert-delete-unsorted-array","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/search-insert-delete-unsorted-array\/","title":{"rendered":"C Programming-Search, insert and delete in an unsorted array"},"content":{"rendered":"

In this post search, insert and delete operation in an unsorted array is discussed.<\/p>\n

 <\/p>\n[ad type=”banner”]\n

Search Operation<\/b><\/p>\n

In an unsorted array, the search operation can be performed by linear traversal from the first element to the last element.<\/p>\n

 <\/p>\n[ad type=”banner”]\n

C Programming<\/strong><\/p>\n

C<\/span> <\/div> 
\/\/ C program to implement linear search in \/\/ unsorted array#include<stdio.h> \/* Function to implement search operation *\/int findElement(int arr[], int n,int key){    int i;    for (i=0; i<n; i++)        if (arr[i] == key)            return i;     return -1;} \/* Driver program to test above function *\/int main(){    int arr[] = {12, 34, 10, 6, 40};    int n = sizeof(arr)\/sizeof(arr[0]);     \/\/Using a last element as search element    int key =40;    int position = findElement(arr,n,key);     if (position==-1)        printf("Element not found");    else        printf("Element Found at Position: %d", position+1 );     return 0;}<\/code><\/pre> <\/div>\n
 <\/p>\n[ad type=”banner”]\n
Output:<\/strong><\/p>\n
Element Found at Position: 5\r\n<\/pre>\n
 <\/p>\n[ad type=”banner”]\n
Insert Operation<\/strong><\/p>\n
In an unsorted array, the insert operation is faster as compared to sorted array because we don\u2019t have to care about the position at which the element is to be placed.<\/p>\n
 <\/p>\n[ad type=”banner”]\n
C Programming<\/b><\/p>\n
 <\/p>\n[ad type=”banner”]\n
 <\/p>\n
Output:<\/strong><\/p>\n
Before Insertion: 12 16 20 40 50 70 \r\nAfter Insertion: 12 16 20 40 50 70 26 \r\n<\/pre>\n
 <\/p>\n[ad type=”banner”]\n
Delete Operation<\/strong><\/p>\n
In delete operation, the element to be deleted is searched using the linear search<\/a> and then delete operation is performed followed by shifting the elements.<\/p>\n
 <\/p>\n[ad type=”banner”]\n
C Programming<\/b><\/p>\n
 
 C<\/span> <\/div> 
\/\/ C program to implement delete operation in a\/\/ unsorted array#include<stdio.h> \/\/ To search a key to be deletedint findElement(int arr[], int n, int key); \/* Function to delete an element *\/int deleteElement(int arr[], int n, int key){    \/\/ Find position of element to be deleted    int pos = findElement(arr, n, key);     if (pos==-1)    {        printf("Element not found");        return n;    }     \/\/ Deleting element    int i;    for (i=pos; i<n-1; i++)        arr[i] = arr[i+1];     return n-1;} \/* Function to implement search operation *\/int findElement(int arr[], int n, int key){    int i;    for (i=0; i<n; i++)        if (arr[i] == key)            return i;     return -1;} \/\/ Driver codeint main(){    int i;    int arr[] = {10, 50, 30, 40, 20};     int n = sizeof(arr)\/sizeof(arr[0]);    int key = 30;     printf("Array before deletion\\n");    for (i=0; i<n; i++)      printf("%d  ", arr[i]);     n = deleteElement(arr, n, key);     printf("\\n\\nArray after deletion\\n");    for (i=0; i<n; i++)      printf("%d  ", arr[i]);     return 0;} <\/code><\/pre> <\/div>\n
 <\/p>\n[ad type=”banner”]\n
Output:<\/p>\n
Array before deletion\r\n10 50 30 40 20 \r\n\r\nArray after deletion\r\n10 50 40 20 \r\n<\/pre>\n
\u00a0Time complexities:<\/strong>
\nSearch:<\/strong> O(n)
\nInsert:<\/strong> O(1)
\nDelete: <\/strong>O(n)<\/p>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
C Programming-Search, insert and delete in an unsorted array-In this post search, insert and delete operation in an unsorted array is discussed.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79658],"tags":[],"class_list":["post-26677","post","type-post","status-publish","format-standard","hentry","category-array"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26677","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26677"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26677\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26677"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26677"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26677"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}