Algorithm_details.html


  <div id="chart_div"></div>
  <a style="font-size:12px;color:#BDBDBD" href="https://livechatai.com/">Powered by LiveChatAI</a>
  <script type="text/javascript" src="https://www.gstatic.com/charts/loader.js"></script>
  <script type="text/javascript">
google.charts.load('current', {'packages':['table']});
  google.charts.setOnLoadCallback(drawTable);

  function drawTable() {
    var data = new google.visualization.DataTable();
    data.addColumn('string', 'Algorithm');
    data.addColumn('string', 'Time Complexity (Average)');
    data.addColumn('string', 'Time Complexity (Worst)');
    data.addColumn('string', 'Space Complexity');
    data.addColumn('boolean', 'Stable');
    data.addColumn('string', 'Notes');
    data.addRows([
      ['Bubble Sort', 'O(n²)', 'O(n²)', 'O(1)', true, 'Simple, inefficient for large lists'],
      ['Selection Sort', 'O(n²)', 'O(n²)', 'O(1)', false, 'Minimizes swaps'],
      ['Insertion Sort', 'O(n²)', 'O(n²)', 'O(1)', true, 'Good for small/nearly sorted lists'],
      ['Merge Sort', 'O(n log n)', 'O(n log n)', 'O(n)', true, 'Stable, good for large lists'],
      ['Quick Sort', 'O(n log n)', 'O(n²)', 'O(log n)', false, 'Fast in practice'],
      ['Heap Sort', 'O(n log n)', 'O(n log n)', 'O(1)', false, 'Uses heap structure'],
      ['Timsort', 'O(n log n)', 'O(n log n)', 'O(n)', true, "Python’s default sort"],
      ['Counting Sort', 'O(n + k)', 'O(n + k)', 'O(n + k)', true, 'For small integer ranges'],
      ['Radix Sort', 'O(nk)', 'O(nk)', 'O(n + k)', true, 'For integers/strings'],
      ['Bucket Sort', 'O(n + k)', 'O(n²)', 'O(n + k)', true, 'For uniformly distributed data']
    ]);

    var table = new google.visualization.Table(document.getElementById('chart_div'));

    table.draw(data, {showRowNumber: true, width: '100%', height: '100%'});
  }</script>