微客导航 » 文章资讯 » 用给定的复杂性约束查找 n 个元素中第二小的 C++ 程序

用给定的复杂性约束查找 n 个元素中第二小的 C++ 程序

2023-06-20 10:03:04 332

这是一个C++程序，用于查找具有给定复杂性约束的n个元素中的第二小。

算法

Begin
   function SecondSmallest() :
      /* Arguments to this function are:
         A pointer array a.
         Number of elements n
      */
   //函数体：
      A variable s1 is declared as to keep track of smallest number.
      A variable s2 is declared as to keep track of second smallest number.
      Initialize both s1 and s2 with INT_MAX.
      Traverse the data array using iteration.
      If current array element is lesser than current value in s1, then s2 = s1 and s1 =
         current array element.
         Else if array element is in between s1 and s2,
            then s2 = current array element.
         if(s2==INT_MAX)
            Print “no second smallest element is present".
         else
      Print s2 as second smallest element.
End

示例

#include
#include  //INT_MAX
using namespace std;
int SecondSmallest(int *a, int n) {
   int s1, s2, i,t;
   //初始化s1和s2
   s1 =INT_MAX;
   s2=INT_MAX;
   for(i = 0; i < n; i++) {
      //如果当前元素小于s1
      if(s1 > a[i]) {
         //更新s1和s2
         s2 = s1;
         s1 = a[i];
      }
      //如果a[i]在s1和s2之间
      else if(s2 > a[i] && a[i]!=s1) {
         //仅更新s2
         s2 = a[i];
      }
   }
   if(s2==INT_MAX)
      cout<<"no second smallest element is present";
   else
      cout<<"第二小的元素是："<>n;
   int array[n];
   for(i = 0; i < n; i++) {
      cout<<"Enter "<>array[i];
   }
   SecondSmallest(array, n); //调用函数
   return 0;
}

输出结果

输入元素数量： 5
Enter 1 element: 1
Enter 2 element: 2
Enter 3 element: 1
Enter 4 element: 3
Enter 5 element: 4
第二小的元素是：2

返回顶部
3162201930
czq8825@qq.com

用给定的复杂性约束查找 n 个元素中第二小的 C++ 程序

算法

示例

热门推荐

随机推荐