Selection Sort List the resulting array after each iteration of the outer loop of the selection sort algorithm. Indicate the number of character-to-character comparisons made for each iteration (line 07 of the Selection Sort algorithm at the end of the assignment). Sort the following array of characters (sort into alphabetical order): CQS A XBT Selection Sort 01 public static void selectionSort (int[] a) { 02 03 int n = a.length; for (int i = 0 ; i 0; j--) { if ( a[j-1] > a[j] ) { exchange(a, j-1, j); } else break; 10 } 12 private static void exchange (int[] a, int i, int j) { 13 // exchange the value at index i with the value at index j int temp = a[i]; a[i] = a[j]; a[j] = temp; 17 }
Solution :
Initial array = [tex]$\text{C,Q,S,A,X,B,T}$[/tex]
[tex]$n= 7$[/tex](length of the array)
[tex]$\text{1st}$[/tex] Iteration:
i = 1
j = 1
[tex]$\text{a[j-1]}$[/tex] = C
a[j] = Q
since [tex]$\text{a[j-1]}$[/tex] < a[j] , break from inner loop
Number of comparisons in 1st Iteration = 1
After 1st Iteration:
Array : C,Q,S,A,X,B,T
2nd Iteration:
i = 2
j = 2
a[j-1] = Q
a[j] = S
since a[j-1] < a[j], break from inner loop
Number of comparisons in 2nd Iteration = 1
After 2nd Iteration:
Array : C,Q,S,A,X,B,T
3rd Iteration:
i = 3
j = 3
a[j-1] = S
a[j] = A
since a[j-1] > a[j], exchange a[2] with a[3]
Array : C,Q,A,S,X,B,T
j = 2
a[j-1] = Q
a[j] = A
since a[j-1] > a[j], exchange a[1] with a[2]
Array : C,A,Q,S,X,B,T
j = 1
a[j-1] = C
a[j] = A
since a[j-1] > a[j], exchange a[0] with a[1]
Array : A,C,Q,S,X,B,T
j = 0, break from inner loop
Number of comparisons in 3rd Iteration = 3
After 3rd Iteration:
Array : A,C,Q,S,X,B,T
4th Iteration:
i = 4
j = 4
a[j-1] = S
a[j] = X
since a[j-1] < a[j], break from inner loop
Number of comparisons in 4th Iteration = 1
After 4th Iteration:
Array : A,C,Q,S,X,B,T
5th Iteration:
i = 5
j = 5
a[j-1] = X
a[j] = B
since a[j-1] > a[j], exchange a[4] with a[5]
Array : A,C,Q,S,B,X,T
j = 4
a[j-1] = S
a[j] = B
since a[j-1] > a[j], exchange a[3] with a[4]
Array : A,C,Q,B,S,X,T
j = 3
a[j-1] = Q
a[j] = B
since a[j-1] > a[j], exchange a[2] with a[3]
Array : A,C,B,Q,S,X,T
j = 2
a[j-1] = C
a[j] = B
since a[j-1] > a[j], exchange a[1] with a[2]
Array : A,B,C,Q,S,X,T
j = 1
a[j-1] = A
a[j] = B
since a[j-1] < a[j], break from inner loop
Number of comparisons in 5th Iteration = 5
After 5th Iteration:
Array : A,B,C,Q,S,X,T
6th Iteration:
i = 6
j = 6
a[j-1] = X
a[j] = T
since a[j-1] > a[j], exchange a[5] with a[6]
Array : A,B,C,Q,S,T,X
j = 5
a[j-1] = S
a[j] = T
since a[j-1] < a[j], break from inner loop
Number of comparisons in 6th Iteration = 2
After 6th Iteration:
Array : A,B,C,Q,S,T,X
Sorted Array : A B C Q S T X
when you sent email your email can be set to automatically keep a copy where do you find these copies
Answer:
It depends on the mail service, but usually there should be a "sent" category.
Explanation:
Under "drafts" there should be an option to "show more" click that then scroll down to sent. from there you should be able to see any email sent from your account.
The residents of the underground city of Zion defend themselves through a combination of kung fu, heavy artillery, and efficient algorithms. Recently they have become interested in automated methods that can help fend off attacks by swarms of robots.
Here is what one of these robot attacks looks like.
• A swarm of robots arrives over the course of n seconds; in the i-th second, xi robots arrive. Based on remote sensing data, you know this sequence x1, x2, . . . , xn in advance.
• You have at your disposal an electromagnetic pulse (EMP), which can destroy some of the robots as they arrive; the EMP’s power depends on how long it has been allowed to charge up. To make it precise, there is a function f(·) so that if j seconds have passed since the EMP was last used, then it is capable of destroying up to f(j) robots.
• So specifically, if it is used in the k-th second, and it has been j seconds since it was previously used, then it destroys min(xk, f(j)) robots. (After this use, it will be completely drained.)
• We will also assume that EMP starts off completely drained, so if it is used for the first time in the j-th second, then it is capable of destroying up to f(j) robots.
The problem is: Given the data on robot arrivals x1, x2, . . . , xn, and given the recharging function f(·), choose the points in time at which you are going to activate the EMP so as to destroy as many robots as possible.
(a) Show that the following algorithm does not correctly solve this problem, by giving an instance on which it does not return the correct answer.
Schedule-EMP(x1, . . . , xn)
Let j be the smallest number for which f(j) ≥ xj
(If no such j exists then set j = n)
Activate the EMP in the j-th second
If n − j ≥ 1 then
Continue recursively on the input xj+1, . . . , xn
(i.e. invoke Schedule-EMP(xj+1, . . . , xn)
In your example, say, what the correct answer is and also what the algorithm above finds.
(b) Give an efficient algorithm that takes the data on robot arrivals x1, . . . , xn, and the recharging function f(·), and returns the maximum number of robots that can be destroyed by a sequence of EMP activations.
Answer: Recently They Have Become Interested In Automated Methods That Can Help Fend Off Attacks By Swarms Of Robots. Here's What One Of These Robot Attacks Looks Like . A Swarm ... The residents of the underground city of Zion defend themselves through a combination of kung fu, heavy artillery, and efficient algorithms.
Explanation:
Select all that apply.
What two values do comparison operators return?
TRUE
EQUAL
LESS THAN
FALSE
Answer:
Equal
Less than
Explanation:
One of our clients is considering a major Cloud transformation project but is concerned about the time and costs associated with such an initiative. What should the security team focus on to address this particular client's concern?
Answer:
About the location the cloud transformation project should be carried out
Which mechanical switches are the loudest and clickiest?
Gateron Blue
Cherry MX Blue
Outemu Blue
also which one is the most expensive?
Answer:
1.Cherry MX Blue
2.most expensive is Gateron Blue
The Basic premise of____is that objects can be tagged, tracked, and monitored through a local network, or across the Internet.
The basic premise of
a. artificial intelligence
b. intelligent workspaces
c. the Internet of Things
d. the digital divide
Answer:
C.
Explanation:
Internet of things
The Basic premise of the Internet of Things is that objects can be tagged, tracked, and monitored through a local network, or across the Internet option (c) is correct.
What is IoT?The term "Internet of things" refers to actual physical items that have sensors, computing power, software, and other innovations and can link to those other systems and gadgets via the Internet or other communication networks and share files with them.
As we know,
Using a local network or the Internet, things may be identified, tracked, and monitored is the fundamental tenet of the Internet of Things.
Thus, the Basic premise of the Internet of Things is that objects can be tagged, tracked, and monitored through a local network, or across the Internet option (c) is correct.
Learn more about the IoT here:
https://brainly.com/question/25703804
#SPJ2
14. Video game legend Shigeru Miyamoto designed all EXCEPT which of the following games?
a) Donkey Kong
b) Mario Bros
c) The Legend of Zelda
d) Pac-Man
Two character strings may have many common substrings. Substrings are required to be contiguous in the original string. For example, photograph and tomography have several common substrings of length one (i.e., single letters), and common substrings ph, to, and ograph as well as all the substrings of ograph. The maximum common substring length is 6. Let X = X122 . Im and Y = yıy2 - - • Yn be two character strings. Using dynamic programming, design an algorithm to find the maximum common substring length for X and Y using dynamic programming. Please follow the general steps for designing a dynamic programming solution as in Q1 (other than the actual programming part).
Answer:
Explanation:
The following function is written in Java. It takes two strings as parameters and calculates the longest substring between both of them and returns that substring length.
import java.util.*;
class Test
{
public static void main(String[] args)
{
String X = "photograph";
String Y = "tomography";
System.out.println(X + '\n' + Y);
System.out.println("Longest common substring length: " + longestSub(X, Y));
}
static int longestSub(String X, String Y)
{
char[] word1 = X.toCharArray();
char[] word2 = Y.toCharArray();
int length1 = X.length();
int length2 = Y.length();
int substringArray[][] = new int[length1 + 1][length2 + 1];
int longestSubstringLength = 0;
for (int i = 0; i <= length1; i++)
{
for (int j = 0; j <= length2; j++)
{
if (i == 0 || j == 0)
substringArray[i][j] = 0;
else if (word1[i - 1] == word2[j - 1])
{
substringArray[i][j]
= substringArray[i - 1][j - 1] + 1;
longestSubstringLength = Integer.max(longestSubstringLength,
substringArray[i][j]);
}
else
substringArray[i][j] = 0;
}
}
return longestSubstringLength;
}
}
CHALLENGE ACTIVITY
1.6.1: Type casting: Computing average owls per zoo.
Assign avg_owls with the average owls per zoo. Print avg_owls as an integer.
Sample output for inputs: 1 2 4
Average owls per zoo: 2
-------------------------------------------------------------------
Someone please explain what I am doing wrong?
Answer:
avg_owls=0.0
num_owls_zooA = int(input())
num_owls_zooB = int(input())
num_owls_zooC = int(input())
num_zoos = 3
avg_owls = (num_owls_zooA + num_owls_zooB + num_owls_zooC) / num_zoos
print('Average owls per zoo:', int(avg_owls))
Explanation:
There is a problem while you are trying the calculate the average owls per zoo.
As you may know, in order to calculate the average, you need to get the total number of owls in all the zoos, then divide it to the number of zoos. That is why you need to sum num_owls_zooA + num_owls_zooB + num_owls_zooC and divide the result by num_zoos
Be aware that the average is printed as integer value. That is why you need to cast the avg_owls to an int as int(avg_owls)
Which tab can be used to change the theme and background style of a presentation?
O Design
O Home
O Insert
O View
Answer:
Design
Explanation:
seems the most correct one..
Prepare a document to list down at least 10 features/operations (on process and thread) you can do using Process Explorer.
Answer:
The operations that can be carried out using process explorer include but are not limited to:
Explanation:
Killing a Process TreeEnding or terminating a processSuspending a processExamining which process has locked a fileManually detecting a virusUnhiding a process. This can help to callup the window for a process that is not visible under normal explorer activitiesMonitor CPU usage setting the priority of a processchanging a service process's access securityMonitoring Graphics Processing Unit
Cheers
is it possible to unlock a password without a password if you forgot
Answer:
no
Explanation:
because u will need an code
Answer:
it should have a reset with email option
Explanation:
I need help
I am thinking about coming out to my mom because we are going to the store today and I will be in the car, I dont know if I should or not
Answer:
do it! you will have to one day so why not now? hopefully she will understand and say nice things as well and be like mom ive
been thinking a lot and i really want to tell you something. Explanation:
Answer:most likely she is your parent that you live with so she might already know but has not said anything it also depends her personality but if your ready and know or think she would not hate you forever go for it
Explanation:
What type of system enables computer data to be stored in multiple locations and shared with multiple users simultaneously?
A. content delivery network
B. consumer delivery network
C. cloud storage
D. World Wide Web
Answer:
A
Explanation:
The following table describes the required fields for two classes and typical values stored in those fields.
You are required to create a base class Printer and its child class PrinterCumScanner. Each of these classes should have user defined constructor and overridden Display() method so that the following test driver can work properly.
Answer:
hope this helps,if it did pls mark my ans as brainliest
Explanation:
using System;
class Printer{ string companyName; int pagesOutput;
double price;
public Printer(string companyName,int pagesOutput,double price){
this.companyName=companyName; this.pagesOutput=pagesOutput; this.price=price;
}
public virtual void Display(){ Console.WriteLine("companyName: "+companyName+" pagesOutput: "+pagesOutput+" price: "+price);
}
}
class PrinterCumScanner:Printer{ int imageDpi;
public PrinterCumScanner(string companyName,int pagesOutput,double price,int imageDpi):base(companyName,pagesOutput,price){ this.imageDpi=imageDpi; }
public override void Display(){ base.Display(); Console.WriteLine("imageDpi: "+imageDpi);
}
}
public class Program { static void Main(string[] args) { const int NUM_PRINTERS=3;
Printer []stock=new Printer[NUM_PRINTERS];
stock[0]=new Printer("HP",40,89.50);
stock[1]=new PrinterCumScanner("HP",40,215.0,320); stock[2]=new PrinterCumScanner("Cannon",30,175.0,240);
foreach(Printer aPrinter in stock){ aPrinter.Display();
}
}
}
Use the drop-down menus to complete the steps to convert a macro to VBA.
1. Open the macro in view.
2. The Design conditional tab will appear.
3. Find the Tools group, and select .
4. The Convert dialog box will open.
5. Click .
6. The macro is now in VBA formatting.
Answer:
1. Design
2. Convert Macros to Visual Basic
3. Convert
Explanation:
Answer:
B D A
Explanation:
Assume that class BankAccount exists, and that it has a constructor that sets the private field balance, and that setBalance and getBalance are defined by class BankAccount and set and get double values. Then what is the output of the following code:________.
a. 600.0
b. 0.0
c. 300.0
d. null
e. an error will result
Assume that class BankAccount exists, and that it has a constructor that sets the private field balance, and that setBalance and getBalance are defined by class BankAccount and set and get double values.
Then what is the output of the following code?
BankAccount b1 = new BankAccount(600.0);
BankAccount b2 = b1;
b1.setBalance(300.0);
System.out.println(b2.getBalance() );
Answer:300.0
Explanation:The given snippet of code is as follows:
=======================================
BankAccount b1 = new BankAccount(600.0);
BankAccount b2 = b1;
b1.setBalance(300.0);
System.out.println(b2.getBalance() );
=======================================
Line 1: An object b1 of the BankAccount class is created which sets the value of its balance to 600.0
Line 2: A second object, b2, is created referencing or pointing to the first object, b1 in memory. It could also be interpreted to mean that a second object b2 is created from the exact copy of the first object, b1. This is called object cloning. This by implication means that all the fields (including the contents of the fields) of the first object b1, are copied to b2 which also means that when there's a change in b1, an update is made to b2 also. If a change is made to b2, b1 also gets updated.
Line 3: Object b1 is updated by setting the value of its balance field to 300.0 using the setBalance() method. This will also update the same field for the second object b2.
Line 4: The value of the balance field of object b2 is being printed to the console. Since the value has been updated in line 3 when that of b1 was updated, 300.0 will be printed to the console.
Hard disk works on the following technologies: (i) Technology used within the hard drive to read & write data to the drive and (ii) Technology used by the hard drive to interface with the system. Explain with a diagram the principle and working of a hard drive.
Answer:
The green-blue circuit board you can see in the first photo includes the disk controller, a circuit that allows the computer to operate the drive's mechanisms and read/write data to and from it. ... A small hard drive typically has only one platter, but each side of it has a magnetic coating
Explanation:
a friend emails a presentation to isabella to view. what kind of change can she make?
Answer:
She can enable editing. She can change the view.
Explanation:
Let's implement a classic algorithm: binary search on an array. Implement a class named BinarySearcher that provides one static method named search. search takes a SearchList as its first parameter and a Comparable as its second. If either parameter is null, or if the SearchList is empty, you should throw an IllegalArgumentException. SearchList is a provided class. It provides a get(int) method that returns the Comparable at that index, and a size method that returns the size of the SearchList. Those are the only two methods you should need! search returns a boolean indicating whether the passed value is located in the sorted SearchList. To search the sorted SearchList efficiently, implement the following algorithm: Examine the value in the middle of the current array (index (start + end) / 2) If the midpoint value is the value that we are looking for, return true If the value that we are looking for is greater than the midpoint value, adjust the current array to start at the midpoint if the value that we are looking for is less than the midpoint value, adjust the current array to end at the midpoint Continue until you find the value, or until the start reaches the end, at which point you can give up and return false This is a fun problem! Good luck! Keep in mind that every time you call SearchList.get that counts as one access, so you'll need to reduce unnecessary accesses to pass the test suite.
Answer:
Hope this helped you, and if it did , do consider giving brainliest.
Explanation:
import java.util.ArrayList;
import java.util.List;
//classs named BinarySearcher
public class BinarySearcher {
// main method
public static void main(String[] args) {
// create a list of Comparable type
List<Comparable> list = new ArrayList<>();
// add elements
list.add(1);
list.add(2);
list.add(3);
list.add(4);
list.add(5);
list.add(6);
list.add(7);
// print list
System.out.println("\nList : "+list);
// test search method
Comparable a = 7;
System.out.println("\nSearch for 7 : "+search(list,a));
Comparable b = 3;
System.out.println("\nSearch for 3 : "+search(list,b));
Comparable c = 9;
System.out.println("\nSearch for 9 : "+search(list,c));
Comparable d = 1;
System.out.println("\nSearch for 1 : "+search(list,d));
Comparable e = 12;
System.out.println("\nSearch for 12 : "+search(list,e));
Comparable f = 0;
System.out.println("\nSearch for 0 : "+search(list,f));
}
// static method named search takes arguments Comparable list and Comparable parameter
public static boolean search(List<Comparable> list, Comparable par) {
// if list is empty or parameter is null the throw IllegalArgumentException
if(list.isEmpty() || par == null ) {
throw new IllegalArgumentException();
}
// binary search
// declare variables
int start=0;
int end =list.size()-1;
// using while loop
while(start<=end) {
// mid element
int mid =(start+end)/2;
// if par equal to mid element then return
if(list.get(mid).equals(par) )
{
return true ;
}
// if mid is less than parameter
else if (list.get(mid).compareTo(par) < 0 ) {
start=mid+1;
}
// if mid is greater than parameter
else {
end=mid-1;
}
}
// if not found then retuen false
return false;
}
}import java.util.ArrayList;
import java.util.List;
//classs named BinarySearcher
public class BinarySearcher {
// main method
public static void main(String[] args) {
// create a list of Comparable type
List<Comparable> list = new ArrayList<>();
// add elements
list.add(1);
list.add(2);
list.add(3);
list.add(4);
list.add(5);
list.add(6);
list.add(7);
// print list
System.out.println("\nList : "+list);
// test search method
Comparable a = 7;
System.out.println("\nSearch for 7 : "+search(list,a));
Comparable b = 3;
System.out.println("\nSearch for 3 : "+search(list,b));
Comparable c = 9;
System.out.println("\nSearch for 9 : "+search(list,c));
Comparable d = 1;
System.out.println("\nSearch for 1 : "+search(list,d));
Comparable e = 12;
System.out.println("\nSearch for 12 : "+search(list,e));
Comparable f = 0;
System.out.println("\nSearch for 0 : "+search(list,f));
}
// static method named search takes arguments Comparable list and Comparable parameter
public static boolean search(List<Comparable> list, Comparable par) {
// if list is empty or parameter is null the throw IllegalArgumentException
if(list.isEmpty() || par == null ) {
throw new IllegalArgumentException();
}
// binary search
// declare variables
int start=0;
int end =list.size()-1;
// using while loop
while(start<=end) {
// mid element
int mid =(start+end)/2;
// if par equal to mid element then return
if(list.get(mid).equals(par) )
{
return true ;
}
// if mid is less than parameter
else if (list.get(mid).compareTo(par) < 0 ) {
start=mid+1;
}
// if mid is greater than parameter
else {
end=mid-1;
}
}
// if not found then retuen false
return false;
}
}
20 POINTS!!!!!!!!!! will give brainliest
A requirements document is created during the _____ phase of software development.
Coding
Planning
Release
Design
Answer:
Release
Explanation:
Founders Education
The variable strFirst's scope is _____.
Answer:
- the usernameMaker function
Explanation:
When you look at the code, you can see it's located alongside the usernameMaker. It it only utilized then, therefore being it's scope. For reassurance, it's also correct on Edge.
I hope this helped!
Good luck <3
(main.c File)
Counting the character occurrences in a file
For this task you are asked to write a program that will open a file called “story.txt”
and count the number of occurrences of each letter from the alphabet in this file.
At the end your program will output the following report:
Number of occurrences for the alphabets:
a was used – times.
b was used – times.
c was used – times…. …and so, on
Assume the file contains only lower-case letters and for simplicity just a single
paragraph. Your program should keep a counter associated with each letter of the
alphabet (26 counters) [Hint: Use array]
Your program should also print a histogram of characters count by adding
a new function print Histogram (int counters []). This function receives the
counters from the previous task and instead of printing the number of times each
character was used, prints a histogram of the counters. An example histogram for
three letters is shown below) [Hint: Use the extended asci character 254]
Answer:
C code
Explanation:
#include <stdio.h>
void histrogram(int counters[])
{
int i,j;
int count;
for(i=0;i<26;i++)
{
count=counters[i];
printf("%c ",i+97);
for(j=0;j<count;j++)
{
printf("="); //= is used
}
printf("\n");
}
}
int main()
{
FILE* fp;
int i;
int arr[26];
char c;
int val;
// Open the file
fp = fopen("story.txt", "r");
if (fp == NULL) {
printf("Could not open file ");
return 0;
}
else
{
for(i=0;i<26;i++)
arr[i]=0;
for (c = getc(fp); c != EOF; c = getc(fp))
{
if(c>='a' && c<='z')
{
val = c-97;
//printf("%d ",val);
arr[val]++;
}
}
histrogram(arr);
}
}
Taran is concerned with the security of his macros in a database. Which security option could he use to provide protection?
digital signatures
hide database objects
start-up options
secure VBA code
Answer:security VBA code
Explanation:
8. Which of the following prompted the creation of video game ratings?
a) Mortal Kombat
b) Super Mario Kart
c) Grain turismo
d) Street Fighter III
Answer: super Mario kart (who don't love mortal Kombat tho)
Explanation:
A major advantage of direct mapped cache is its simplicity and ease of implementation. The main disadvantage of direct mapped cache is: a. it is more expensive than fully associative and set associative mapping. b. it has a greater access time than any other method. c. its performance is degraded if two or more blocks that map to the same location are used alternately. d. it does not allow the cache to store the tag that corresponds to the block currently residing in that cache location.
brainlest pl jk mmmmmmmmmmmmm
Write an algorithm (pseudo-code) that takes an unsorted list of n integers and outputs a sorted list of all duplicate integers. There must be no duplicates in the output list, also the output list should be a sorted list. The algorithm must run in O(n) time. Show your analysis of the running time. Note: Assume that inputs are integer values from 0 to 255. (Hint: use the concept that being used in the separate chaining)
Answer:
brainliest if it did help you
Explanation:
Given array : A[0...n-1]Now, create a count array Cnt[0...n-1]then, initialize Cnt to zero
for(i=0...n-1)
Cnt[i]=0 ---------O(n) time
Linearly traverse the list and increment the count of respected number in count array.
for(i=0...n-1)
Cnt[A[i]]++; ---------O(n) time
Check in the count array if duplicates exist.
for(i=0...n-1){
if(C[i]>1)
output (i); -----------O(n) time
}
analysis of the above algorithm:
Algorithm takes = O(1 + n + n + n)
= O(n)
//java code
public class SortIntegers {
public static void sort(int[] arr) {
int min = arr[0];
int max = arr[0];
for (int i = 0; i < arr.length; ++i) {
if (arr[i] > max) {
max = arr[i];
}
if (arr[i] < min) {
min = arr[i];
}
}
int counts[] = new int[max - min + 1];
for (int i = 0; i < arr.length; ++i) {
counts[arr[i] - min]++;
}
for (int i = 0; i < counts.length; ++i) {
if (counts[i] > 1) {
System.out.print((i + min) + " ");
}
}
System.out.println();
}
public static void main(String[] args) {
sort(new int[] { 5, 4, 10, 2, 4, 10, 5, 3, 1 });
}
}
Sergio needs to tell his team about some negative feedback from a client. The team has been
working hard on this project, so the feedback may upset them. Which of the following explains
the best way for Sergio to communicate this information?
A) Hold an in person meeting so that he can gauge the team's body language to assess their
reaction
B) Send a memorandum so everyone will have the feedback in writing
C) Hold a video conference so everyone can see and hear about the client's concern without the group witnessing each other's reactions
D) Send an email so everyone will have time to think about the feedback before the next team meeting
Answer:
A
Explanation:
I feel that if everyone is with eachother, there may be a better hope to improve the next time
The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() method, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1.
Ex: If the input is: 7
the out put is :fibonacci(7) is 13
Note: Use recursion and DO NOT use any loops. // is this mean i don't have to use loops? for (int i = 1; i<= n; ++i)
import java.util.Scanner;
public class LabProgram {
public static int fibonacci(int n) {
/* Type your code here. */
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
int startNum;
System.out.println("Enter your number: ");
startNum = scnr.nextInt();
System.out.println("fibonnaci(" + startNum + ") is " + fibonacci(startNum));
}
}
Answer:
if this helps you,do consider marking my ans as brainliest.
Explanation:
import java.util.Scanner;
public class LabProgram{
public static int fibonacci(int n) {
/* Type your code here. */
if(n<0)
return -1;
if(n==0||n==1)
return n;
else
return fibonacci(n-1)+fibonacci(n-2);
}
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
int startNum;
System.out.println("Enter your number: ");
startNum = scnr.nextInt();
System.out.println("fibonnaci(" + startNum + ") is " + fibonacci(startNum));
}
}
Recursions involve calling a function from the function itself, until a condition is met.
The required function, where comments are used to explain each line is as follows:
//This defines the function
public static int fibonacci(int n) {
//The function returns -1, if n is negative
if(n<0){
return -1;}
//The function returns the value of n, if n is 0 or 1
if(n==0||n==1){
return n;}
//If otherwise
else{
//The function returns the nth term of the Fibonacci series
return fibonacci(n-1)+fibonacci(n-2);
}
}
At the end of the program, the nth term of the Fibonacci series is printed.
Read more about similar programs at:
https://brainly.com/question/24212022