如何显示一个接一个的功能输出

时间:2016-05-30 05:36:56

标签: javascript node.js algorithm sorting output

我写了两个算法的Javascript文件。如下面的代码所示,我使用for loop生成随机值,这两个算法都用作输入。

目前,我正在显示binarySearchSearchSorted的输出。

我遇到的问题是我必须传递 主程序中randomlyGenerateArray生成的 相同数组值 两种算法进行有意义的比较。但我不知道如何更改输出格式。

我曾想过将它们添加到不同的循环中,但正如我上面所解释的,我需要为这两种算法使用相同的randomArray值。

即,下面的代码产生如下所示的输出 -

Binary Search Successful 1 Search Sorted Successful 5 Binary Search Successful 3 Search Sorted Successful 10

如何显示Binary Search First的输出,然后显示Search Sorted的输出?它是这样的。任何帮助将不胜感激。

Binary Search Successful 1 Binary Search Successful 3 Search Sorted Successful 5 Search Sorted Successful 10

// Binary Search Algorithm
function binarySearch(A,K)
{
     var l = 0; // min
     var r = A.length - 1; //max
     var n = A.length;
     var operations = 0;

     while(l <= r)
     {   
          var m = Math.floor((l + r)/2);
          operations++;

          if(K == A[m])
          {
              console.log('Binary Search Successful %d',operations);
              return m;
          }
          else if(K < A[m])
          {
              r = m - 1;
          }
          else
          {
              l = m + 1;
          }
     }
     operations++;
     console.log('Binary Search Unsuccessful %d',operations);
     return -1;
}

// Search Sorted Algorithm
function searchSorted(A, K) 
{
    var n = A.length;
    var i = 0;
    var operations = 0;

    while (i < n) 
    {
        operations++;
        if (K < A[i]) 
        {
            return -1;
        }
        else if (K == A[i])
        {
            console.log('Search Sorted Successful %d', operations);
            return i;
        }
        else 
        {
            i = i + 1;
        }
   }
   operations++;
   console.log('Search Sorted Unsuccessful %d', operations);
   return -1;
}

// Random Array generator
var randomlyGenerateArray = function(size)
{
    var array = [];
    for (var i = 0; i < size; i++)
    {
        var temp = Math.floor(Math.random() * maxArrayValue);
        var final = array.splice(5, 0, 30);
        array.push(final);
    }
    return array;
}

//Sort the Array
var sortNumber = function(a, b)
{
    return a - b;
}

// Main Program
var program = function()
{
    var incrementSize = largestArray / numberOfArrays;
    for (var i = smallestArray; i <= largestArray; i += incrementSize)
    {
        var randomArray = randomlyGenerateArray(i);
        var sort = randomArray.sort(sortNumber);
        var randomKey = 30;
        binarySearch(sort, randomKey);
        searchSorted(sort, randomKey);
    }
}

var smallestArray = 10;
var largestArray = 10000;
var numberOfArrays = 1000;
var minArrayValue = 1;
var maxArrayValue = 1000;

program();

2 个答案:

答案 0 :(得分:1)

解决方案很简单:存储结果并使用2个单独的循环打印(从功能中取出打印)。

var program = function()
{
    var binarySearchResults = [];
    var sortedSearchResults = [];
    var incrementSize = largestArray / numberOfArrays;
    for (var i = smallestArray; i <= largestArray; i += incrementSize)
    {
        var randomArray = randomlyGenerateArray(i);
        var sort = randomArray.sort(sortNumber);
        var randomKey = 30;
        binarySearchResults[i] = binarySearch(sort, randomKey);
        sortedSearchResults[i] = searchSorted(sort, randomKey);
    }

    for (var i = smallestArray; i <= largestArray; i += incrementSize)
    {
       //print binary results
    }

    for (var i = smallestArray; i <= largestArray; i += incrementSize)
    {
       //print sorted results
    }

}

答案 1 :(得分:1)

您可以将已排序的randomArray存储在数组中(我称之为sortedRandomArrays),然后为每次搜索运行for循环。

主程序如下:

// Main Program
var program = function()
{
    var incrementSize = largestArray / numberOfArrays;
    var sortedRandomArrays = [];
    for (var i = smallestArray; i <= largestArray; i += incrementSize)
    {
        var randomArray = randomlyGenerateArray(i));
        var sort = randomArray.sort(sortNumber);
        sortedRandomArrays.push(sort);
        var randomKey = 30;
    }

    for (var i = 0; i < sortedRandomArrays.length; i++)
    {
        binarySearch(sortedRandomArrays[i], randomKey);
    }

    for (var i = 0; i < sortedRandomArrays.length; i++)
    {
        searchSorted(sortedRandomArrays[i], randomKey);
    }
}