Concom sorting algorithm

In Data Structures, sorting is a technique which is used for arranging data in a particular order either ascending or descending. Sorting techniques like Bubble sort, Insertion sort and Selection sort are comparison based. Our proposed technique is a combination of both comparison and counting based techniques. We are finding the exact position of an element and placing it in its corresponding position. A sorting technique is said to be optimal based on its time & space complexity. The algorithm we designed is said to be optimal, based on the number of swap´s compared to existing techniques like bubble sort, insertion sort.