Spread the word.

Share the link on social media.

Share
  • Facebook
Have an account? Sign In Now

Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

Sorry, you do not have permission to ask a question, You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Logo SIKSHAPATH Logo

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask A Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Home/ Questions/Q 18412
Next
In Process

SIKSHAPATH Latest Questions

Pavanagg
  • 0
  • 0
Pavanagg
Asked: June 1, 20222022-06-01T20:18:19+05:30 2022-06-01T20:18:19+05:30In: C++

Write a C++ function, smallestIndex, that takes as parameters an …

  • 0
  • 0

Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value.

An example of the program is shown below:

Enter 15 integers: 1 2 3 4 5 6 7 8 9 0 10 11 12 13 14 1 2 3 4 5 6 7 8 9 0 10 11 12 13 14

The position of the first occurrence of the smallest element in list is: 9

The smallest element in list is: 0

  • 1 1 Answer
  • 166 Views
  • 0 Followers
  • 0
Answer
Share
  • Facebook

    1 Answer

    • Voted
    • Oldest
    • Recent
    1. ADMIN 2
      ADMIN 2
      2022-06-01T20:20:00+05:30Added an answer on June 1, 2022 at 8:20 pm
      #include <iostream>
      using namespace std;
      
      int smallestIndex(int array[], int Size);
      
      int main()
      {
      const int SIZE = 15;
      int array[SIZE], i;
      
      for (int i = 0; i < SIZE; i++) {
      cout<<"Enter array["<<i<<"] : ";
      cin >> array[i] ;
      }
      
      smallestIndex(array, SIZE);
      
      cout << "The smallest index position is: " 
      5<< smallestIndex(array, SIZE) << endl;
      system("pause");
      return 0;
      }
      
      
      int smallestIndex(int array[], int Size)
      {
      int smallest = 0, i;
      for (i = 0; i < Size; i++) {
      if (array[i] < array[smallest]) 
      smallest = i;
      }
      return smallest;
      }
        • 0
      • Reply
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn

    Leave an answer
    Cancel reply

    You must login to add an answer.

    Forgot Password?

    Need An Account, Sign Up Here

    Sidebar

    store ads

    Stats

    • Questions 1k
    • Answers 1k
    • Posts 149
    • Best Answers 89
    • This Free AI Tool Translates Entire Books in Minute !
    • AI News: 🎬 Hollywood’s AI Studios, 🎓 OpenAI’s Latest Gift to Educators, 🚚 Class8 Bags $22M, 🧠 Google Gemini’s Memory Upgrade
    • AI NEWS: Legal Action Against OpenAI, $16M Paid, & Elon Musk’s Praise from Investor 🤖💰📑 | AI Boosts Cloud Seeding for Water Security 🌱💧
    • AI News: 🎬AI Video Tool Scam Exposed🤯, 🛰️ AI-Powered Drones to Ukraine 😱, Google’s $20M AI Push, Sam Altman Joins SF’s Leadership Team
    • AI News: 🤝 Biden Meets Xi on AI Talks, 💡 Xavier Niel’s Advice for Europe, ♻️ Hong Kong’s Smart Bin Revolution, 🚀 AI x Huawei

    Explore

    • Recent Questions
    • Questions For You
    • Answers With Time
    • Most Visited
    • New Questions
    • Recent Questions With Time

    Footer

    SIKSHAPATH

    Helpful Links

    • Contact
    • Disclaimer
    • Privacy Policy Notice
    • TERMS OF USE
    • FAQs
    • Refund/Cancellation Policy
    • Delivery Policy for Sikshapath

    Follow Us

    © 2021-24 Sikshapath. All Rights Reserved

    Insert/edit link

    Enter the destination URL

    Or link to existing content

      No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.