{"id":25232,"date":"2017-10-15T15:57:17","date_gmt":"2017-10-15T10:27:17","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25232"},"modified":"2017-10-15T15:57:17","modified_gmt":"2017-10-15T10:27:17","slug":"find-minimum-length-unsorted-subarray-sorting-makes-complete-array-sorted","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/find-minimum-length-unsorted-subarray-sorting-makes-complete-array-sorted\/","title":{"rendered":"Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted"},"content":{"rendered":"

Given an unsorted array arr[0..n-1] of size n, find the minimum length subarray arr[s..e] such that sorting this subarray makes the whole array sorted.<\/span>
\n
\nExamples:<\/strong>
\n1) If the input array is [10, 12, 20, 30, 25, 40, 32, 31, 35, 50, 60], your program should be able to find that the subarray lies between the indexes 3 and 8.<\/p>\n

2) If the input array is [0, 1, 15, 25, 6, 7, 30, 40, 50], your program should be able to find that the subarray lies between the indexes 2 and 5.
\n
\n<\/a><\/p>\n

We strongly recommend that you click here and practice it, before moving on to the solution.
\nSolution:<\/strong>
\n1) Find the candidate unsorted subarray <\/strong>
\na) Scan from left to right and find the first element which is greater than the next element. Let s <\/em>be the index of such an element. In the above example 1, s <\/em>is 3 (index of 30).
\nb) Scan from right to left and find the first element (first in right to left order) which is smaller than the next element (next in right to left order). Let e <\/em>be the index of such an element. In the above example 1, e is 7 (index of 31).<\/p>\n

2) Check whether sorting the candidate unsorted subarray makes the complete array sorted or not. If not, then include more elements in the subarray.<\/strong>
\na) Find the minimum and maximum values in arr[s..e]<\/em>. Let minimum and maximum values be min <\/em>and max<\/em>. min <\/em>and max <\/em>for [30, 25, 40, 32, 31] are 25 and 40 respectively.
\nb) Find the first element (if there is any) in arr[0..s-1]<\/em> which is greater than min<\/em>, change s <\/em>to index of this element. There is no such element in above example 1.
\nc) Find the last element (if there is any) in arr[e+1..n-1] <\/em>which is smaller than max, change e <\/em>to index of this element. In the above example 1, e is changed to 8 (index of 35)<\/p>\n

3) Print s <\/em>and e<\/em>.<\/strong><\/p>\n

 <\/p>\n

Implementation:<\/strong><\/p>\n

c<\/strong><\/p>\n

c<\/span> <\/div> 
#include<stdio.h>  void printUnsorted(int arr[], int n){  int s = 0, e = n-1, i, max, min;       \/\/ step 1(a) of above algo  for (s = 0; s < n-1; s++)  {    if (arr[s] > arr[s+1])      break;  }  if (s == n-1)  {    printf("The complete array is sorted");    return;  }    \/\/ step 1(b) of above algo  for(e = n - 1; e > 0; e--)  {    if(arr[e] < arr[e-1])      break;  }    \/\/ step 2(a) of above algo  max = arr[s]; min = arr[s];  for(i = s + 1; i <= e; i++)  {    if(arr[i] > max)      max = arr[i];    if(arr[i] < min)      min = arr[i];  }    \/\/ step 2(b) of above algo  for( i = 0; i < s; i++)  {    if(arr[i] > min)    {        s = i;      break;    }        }     \/\/ step 2(c) of above algo  for( i = n -1; i >= e+1; i--)  {    if(arr[i] < max)    {      e = i;      break;    }   }          \/\/ step 3 of above algo  printf(" The unsorted subarray which makes the given array "         " sorted lies between the indees %d and %d", s, e);  return;}  int main(){  int arr[] = {10, 12, 20, 30, 25, 40, 32, 31, 35, 50, 60};  int arr_size = sizeof(arr)\/sizeof(arr[0]);  printUnsorted(arr, arr_size);  getchar();  return 0;}<\/code><\/pre> <\/div>\n
JAVA<\/strong><\/p>\n
 
 java<\/span> <\/div> 
class Main{    static void printUnsorted(int arr[], int n)    {      int s = 0, e = n-1, i, max, min;                \/\/ step 1(a) of above algo      for (s = 0; s < n-1; s++)      {        if (arr[s] > arr[s+1])          break;      }      if (s == n-1)      {        System.out.println("The complete array is sorted");        return;      }             \/\/ step 1(b) of above algo      for(e = n - 1; e > 0; e--)      {        if(arr[e] < arr[e-1])          break;      }             \/\/ step 2(a) of above algo      max = arr[s]; min = arr[s];      for(i = s + 1; i <= e; i++)      {        if(arr[i] > max)          max = arr[i];        if(arr[i] < min)          min = arr[i];      }             \/\/ step 2(b) of above algo      for( i = 0; i < s; i++)      {        if(arr[i] > min)        {            s = i;          break;        }            }              \/\/ step 2(c) of above algo      for( i = n -1; i >= e+1; i--)      {        if(arr[i] < max)        {          e = i;          break;        }       }                   \/\/ step 3 of above algo      System.out.println(" The unsorted subarray which"+                         " makes the given array sorted lies"+                       "  between the indices "+s+" and "+e);      return;    }           public static void main(String args[])    {      int arr[] = {10, 12, 20, 30, 25, 40, 32, 31, 35, 50, 60};      int arr_size = arr.length;      printUnsorted(arr, arr_size);    }}<\/code><\/pre> <\/div>\n
Time Complexity: <\/strong>O(n)<\/p>\n
Please write comments if you find the above code\/algorithm incorrect, or find better ways to solve the same problem.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted -Searching and sorting – Given an unsorted array arr[] of size n. find the minimum length subarray arr[s..e]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,71670,83510],"tags":[71128,71222,70962,71133,71893,2380,71127,70461,71121,72377,71134,71141,70978,71131,70531,70975,72378,71123,71130,71122,71129,71139,70780,72379,72305,71146,72381,70533,71144,72374,70928,70966,71216,70017,70976,72376,71158,70969,72308,70046,71714,71712,71120,70016,70961,70548,70960,72382,72380,72299,71695,70020,72304,71149,70967,71219,71142,72375,72185],"class_list":["post-25232","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-searching-and-sorting","category-unsorted-subarray","tag-algorithm-for-bubble-sort","tag-algorithm-for-insertion-sort","tag-algorithm-for-selection-sort","tag-algorithm-of-bubble-sort","tag-algorithm-sort","tag-array-sort","tag-bubble-short","tag-bubble-sort","tag-bubble-sort-algorithm","tag-bubble-sort-algorithm-c-code","tag-bubble-sort-algorithm-with-example","tag-bubble-sort-animation","tag-bubble-sort-c","tag-bubble-sort-code","tag-bubble-sort-complexity","tag-bubble-sort-example","tag-bubble-sort-example-c","tag-bubble-sort-in-c","tag-bubble-sort-in-data-structure","tag-bubble-sort-java","tag-bubble-sort-program","tag-bubble-sort-pseudocode","tag-bubblesort","tag-c-bubble-sort-example","tag-c-sort","tag-comparison-of-sorting-algorithms","tag-complete-array","tag-complexity-of-bubble-sort","tag-different-sorting-algorithms","tag-find-the-minimum-length-unsorted-subarray","tag-heap-sort-algorithm","tag-insert-sort","tag-insertion-sort","tag-insertion-sort-algorithm","tag-insertion-sort-example","tag-java-bubble-sort","tag-java-sort","tag-java-sorting-algorithms","tag-list-of-sorting-algorithms","tag-quicksort","tag-quicksort-algorithm-in-data-structure","tag-quicksort-algorithm-with-example","tag-selection-sort","tag-selection-sort-algorithm","tag-selection-sort-example","tag-selection-sort-in-data-structure","tag-selection-sort-java","tag-simple-sort-c","tag-sort-an-array","tag-sort-c","tag-sorted","tag-sorting-algorithms","tag-sorting-algorithms-c-code","tag-sorting-algorithms-in-data-structures","tag-sorting-algorithms-java","tag-sorting-in-c","tag-sorting-in-data-structure","tag-sorting-which-makes-the-complete-array-sorted","tag-sortings"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25232","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=25232"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25232\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25232"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25232"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25232"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}