Sorting Techniques in Data Structure - Dr B Shamreen Ahamed

Поделиться
HTML-код
  • Опубликовано: 2 окт 2024
  • The video describes the sorting Techniques used in the concept of data structures. Sorting as a whole consists of elements or values that are arranged in unsorted order. These elements need to be converted into a sorted list. It can be arranged as either ascending order or descending order. The various methods and categories by which the data or array used in the system can be sorted as shown in the video. The various sorting types are explained briefly and one sorting mechanism namely bubble sort is explained in detail along with an example illustration. The concept of bubble sort is elaborated in detail using an unsorted array as an example. The elements used in the array are traversed one by one from the beginning to the end into various passes in order to identify the final sorted list. The elements occuring next to each other are compared and the smaller value takes the position on the left and the higher element takes the value on the right thus resulting in a sorted list after several passes.The concept of swapping takes place between the two elements, hence resulting in a sorted array or list. Therefore in this way, an unsorted list of elements are converted into a sorted list of elements
    #sorting #sathyabama #bubble #bubblesort #swapping #elements #datastructures #array #unsorted #sorted

Комментарии •