<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "https://jats.nlm.nih.gov/publishing/1.3/JATS-journalpublishing1-3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.3" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">IJTNS</journal-id>
      <journal-title-group>
        <journal-title>International Journal of Technical and Natural Sciences</journal-title>
        <abbrev-journal-title abbrev-type="publisher">IJTNS</abbrev-journal-title>
      </journal-title-group>
      <issn publication-format="print">2671-3500</issn>
      <issn publication-format="electronic">2671-3519</issn>
      <publisher>
        <publisher-name>Balkan University Press</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="publisher-id">331</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>RESULTS OF COMPARISON BETWEEN DIFFERENT SORTING ALGORITHMS</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Halili</surname>
            <given-names>Festim</given-names>
          </name>
          <xref ref-type="aff" rid="aff1" />
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Dika</surname>
            <given-names>Edlira</given-names>
          </name>
          <xref ref-type="aff" rid="aff1" />
        </contrib>
        <aff id="aff1">
          <institution>IBU</institution>
        </aff>
      </contrib-group>
      <pub-date publication-format="electronic" date-type="pub" iso-8601-date="2021-06-30">
        <day>30</day>
        <month>06</month>
        <year>2021</year>
      </pub-date>
      <volume>2</volume>
      <issue>1</issue>
      <fpage>39</fpage>
      <lpage>52</lpage>
      <permissions>
        <license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/">
          <license-p>CC BY-NC-ND 4.0</license-p>
        </license>
      </permissions>
      <self-uri xlink:href="https://ijtns.ibupress.com/articles/results-of-comparison-between-different-sorting-algorithms" />
      <abstract>
        <p>Analysis of algorithms is an issue that has always stimulate enormous curiosity. There are logical techniques for estimating the complexity of an algorithm. Generally, a more convenient solution is to estimate the run time analysis of the algorithm. The present piece of investigation documents the comparative analysis of five different sorting algorithms of data structures Bubble Sort, Heap Sort, Straight Insertion Sort, Shell Insertion Sort, and Quick Sort. The running time of these algorithms is calculated with the C++ language. These sorting algorithms are also compared on the basis of various parameters like complexity, method, memory, etc.</p>
      </abstract>
      <kwd-group kwd-group-type="author">
        <kwd>sorting algorithms</kwd>
        <kwd>sort</kwd>
        <kwd>algorithm</kwd>
      </kwd-group>
    </article-meta>
  </front>
</article>