{"id":4140,"date":"2023-08-29T08:28:54","date_gmt":"2023-08-29T02:58:54","guid":{"rendered":"https:\/\/cbsepython.in\/?p=4140"},"modified":"2023-08-29T08:28:54","modified_gmt":"2023-08-29T02:58:54","slug":"searching-and-sorting-techniques-notes","status":"publish","type":"post","link":"https:\/\/cbsepython.in\/searching-and-sorting-techniques-notes\/","title":{"rendered":"Data Structure- Searching and Sorting Techniques Notes Class 12"},"content":{"rendered":"

Searching and Sorting Techniques Notes<\/span><\/h2>\n

Sorting <\/strong><\/span><\/p>\n

Sorting means to arrange the data either in ascending order or descending order. It is the process of rearranging a sequence of objects so as to put them in some logical order.<\/span><\/p>\n

 <\/p>\n

 <\/p>\n

Selection Sort :\u00a0 <\/strong>Find the minimum element in unsorted array and swap it with the element in the begining\u00a0 of the sorted array.<\/span><\/p>\n

 <\/p>\n

 <\/p>\n

Advantages of selection sort <\/strong><\/span><\/p>\n

    \n
  1. Selection sort algorithm is 60% more efficient than bubble sort algorithm.<\/span><\/li>\n
  2. Selection sort algorithm is easy to implement.<\/span><\/li>\n
  3. Selection sort algorithm can be used for small data sets, unfortunately Insertion sort algorithm best suitable for it.<\/span><\/li>\n<\/ol>\n

    Disadvantages of selection sort <\/strong><\/span><\/p>\n

      \n
    1. Insertion sort algorithm is far better than selection sort algorithm.<\/span><\/li>\n
    2. Runtime of selection sort is algorithum is very poor<\/span><\/li>\n<\/ol>\n

      Bubble Sort : <\/strong>Bubble sort is a simple sorting algorithum. This sorting algorithum is compaison based algorithum is which each pair of adjacmt elements is compared and element are swapped if they\u00a0 are not in order.<\/span><\/p>\n

        \n
      • Compare two adjoining values and exchange them, if they are not in proper order.<\/span><\/li>\n
      • After pass1, the largest element of the list will be at bottom.<\/span><\/li>\n
      • If we have array of n elements ,we have to do n-1 iterations before we get our sorted array<\/span><\/li>\n<\/ul>\n

        Advantages of Bubble sort\u00a0\u00a0\u00a0 <\/strong><\/span><\/p>\n

          \n
        1. Bubble sort is one of the easiest sort algorithum<\/span><\/li>\n
        2. It is easy to implement<\/span><\/li>\n
        3. Elements are swapped in place, no use of extra array<\/span><\/li>\n<\/ol>\n

          Disadvantages of Bubble Sort <\/strong><\/span><\/p>\n

            \n
          1. Bubble sort algorithum is not suitable for large data sets<\/span><\/li>\n
          2. The code become complex for larger number of data<\/span><\/li>\n<\/ol>\n

             <\/p>\n

             <\/p>\n

            Insertion\u00a0 Sort : <\/strong>\u00a0<\/span><\/p>\n

            Insert an element from unsorted array to its correct position in sorted array . In Insertion sort, we assume the first element to be sorted.<\/span><\/p>\n

             <\/p>\n

            Advantages of Insertion sort<\/strong><\/span><\/p>\n

              \n
            1. Simple to code<\/span><\/li>\n
            2. Good performance with small list<\/span><\/li>\n
            3. Memory efficient<\/span><\/li>\n<\/ol>\n

              Disadvantages of Insertion sort<\/strong><\/span><\/p>\n

                \n
              1. Poor efficiency when dealing with huge list of items<\/span><\/li>\n
              2. Requires extra space<\/span><\/li>\n
              3. Not as quick as merge or quick sort<\/span><\/li>\n<\/ol>\n

                 <\/p>\n","protected":false},"excerpt":{"rendered":"

                Searching and Sorting Techniques Notes Sorting Sorting means to arrange the data either in ascending order or descending order. It is the process of rearranging a sequence of objects so as to put them in some logical order.     Selection Sort :\u00a0 Find the minimum element in unsorted array and swap it with the […]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[16,20],"tags":[],"class_list":["post-4140","post","type-post","status-publish","format-standard","hentry","category-cbse-sample-papers-class-12","category-cbse-computer-science-with-python-class-12"],"_links":{"self":[{"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/posts\/4140","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/comments?post=4140"}],"version-history":[{"count":0,"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/posts\/4140\/revisions"}],"wp:attachment":[{"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/media?parent=4140"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/categories?post=4140"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cbsepython.in\/wp-json\/wp\/v2\/tags?post=4140"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}