Attached is a programming problem and its Java solution. My questions regarding the recursion part: 1. Say my input is "ab". When "str.length()==0" evaluates true for the first time, "ab" is printed. The str.length is already 0, how can the recursion proceed with "char ch = str.charAt(i)"? The str seems to magically restore itself back to "ab" after each permutation gets printed. Why? Word ScramblerTime Limit: 0.6sMemory Limit: 32MLooking to find some clever anagrams, you want a helper tool that will list all possible arrangements of letters for agiven source word. To make the list easier to scan, the output should be in ascending sorted order.Input SpecificationThe input will consist of one string of lower-case alphabet characters, at least 1 character long, and no more than 5.Output SpecificationThe output should contain all the possible combinations of letters in the word, sorted alphabetically.To make things easier, all of the letters in each word are guaranteed to be unique (so then every combination will alsobe unique).Note: since there are n! possibilities for combinations of n letters, you can use that fact to check that you have the rightnumber of possibilities in your output.Sample InputabcSample Outputabcacbbacbcacabcba import java.util.*;import java.io.*;public class Main{static void printPermutation(String str, String ans){if (str.length()==e){System.out.println(ans);}for (int i=0;i

Suppose take the string "ab" printPermutation("ab",""): Since the length of string is 2, for loop…

1. Say my input is "ab". When "str.length()==0" evaluates true for the first time, "ab" is printed. The str.length is already 0, how can the recursion proceed with "char ch = str.charAt(i)"? The str seems to magically restore itself back to "ab" after each permutation gets printed. Why?

1. Say my input is "ab". When "str.length()==0" evaluates true for the first time, "ab" is printed. The str.length is already 0, how can the recursion proceed with "char ch = str.charAt(i)"? The str seems to magically restore itself back to "ab" after each permutation gets printed. Why?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Similar questions

Transcribed Image Text Develop a C++ code to computer the queries in X Y z format where you are given a list of size m. For computing queries, you have to perform the task to find the number which is occurring one after another in the sub-list [X Y] greater than or similar to z times. If there doesn't exist no number satisfying the given criteria then output “Not possible" other than that output the answer computed to the given queries. Test Case Result 4 1 2133 121
ing Your goal is to modify your Assignment 6 program to allow the user to pick up a random item and display a sorted list of the contents of the knap sack. Note: If you use the built in C++, the most you can make on this assignment is 4 out of 10. You are expected to right your own sort based on one of the algorithms covered in class. Your program should have the following: • The name of the program should be Assignment 6. • 3 comment lines (description of the program, author, and date). • Modify your Assignment 5 program to do the following: o Display a menu (use a switch statement to implement the menu) of actions ▪ Attack: • For now, just display that the user chose to attack ▪ Pick up Item: • Randomly add one of 6 items to an array named knapSack o You get to choose the item names • Display which item the user picked up ▪ Add an option to the main switch statement: Display Knap Sack contents • The contents of the knap sack must be sorted Make the code easy…
Contact list: Binary Search A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe 123-5432 Linda…
InterpolationAssignment DescriptionMeike, our climate scientist, was very happy with the program you wrote to calculate the maximum temperature drop. Now she has the following problem; in a series of measurements shediscovers one data point is missing, but not which one. She does know that the measurementsshow a constant increase.Write a function, interpolate(list), that completes a given series. Provide as output the indexbehind which the element should be inserted and the value. You can assume that the measurements are natural numbers and that the input consists of at least 3 measurements. You can assumethat both the first and the last data point have not been droppedP.S. Meike is in a hurry; your algorithm must run in O(log n) time.ExampleInput Output 1 Output 2[1, 2, 4] 1 3[3, 7, 11, 19] 2 15NotesMake sure to turn in your code with the filename “Interpolation.py”. If you turn it in withany other name it will fail the tests. This is due to instead of this assignment giving you an…
Binary Search of Strings1. Write a version of the selection sort algorithm presented in the unit, which is usedto search a list of strings.2. Write a version of the binary search algorithm presented in the unit, which isused to search a list of strings. (Use the selection sort that you designed aboveto sort the list of strings.)3. Create a test program that primes the list with a set of strings, sorts the list, andthen prompts the user to enter a search string. Your program should then searchthe list using your binary search algorithm to determine if the string is in the list.Allow the user to continue to search for strings until they choose to exit theprogram
Help me please... Create a program that would accept 10 strings from the user (each string has a maximum of 10 characters, letters only, no spaces). Your goal now is to sort them in lexicographical order (dictionary order) regardless of the case. You need to implement the functions toLowerCase and toUpperCase. You are free to use any sorting algorithm discussed. Example: Give me word number 1: banana Give me word number 2: apple Give me word number 3: asdfer Give me word number 4: zerosx Give me word number 5: banerZ Give me word number 6: ApPle Give me word number 7: ChoP Give me word number 8: chop Give me word number 9: ZerosX Give me word number 10: zErosx
Use RACKET stride: a macro that takes a variable name var, a stride length n, a list lst, and an expression expr, and returns the list of values resulting from evaluating expr with var set to each n-th value from the lst. E.g., > (stride x 2 '("hello" "how" "are" "you" "this" "fine" "day") (string-upcase x)) '("HELLO" "ARE" "THIS" "DAY") > (stride x 5 (range 30) (sqr x)) '(0 25 100 225 400 625) build the code: (define-syntax-rule (stride var n lst expr) void)
Pls do fast and i will rate instantly for sure Solution must be in typed form As a first programming assignment, use your IDE to create and document (with inline Javadoc comments) a Java program defining two lists of random integers. List 1 should contain 100 elements and list 2 should contain 1000 elements. • Define list 1 as an Array and list 2 as an ArrayList (you should have a total of four lists.) • Sort each list, first using a “Selection Sort” and second using an “Insertion Sort.” Note: if needed, find on the web algorithms for the Selection and Insertion sort algorithms. • To evaluate the two sorting algorithms and your laptop’s performance, include in your sorting routines a code timer like the one given below. • Show the respective performance of the sorts to be O(n 2).
Return Growing NumList This function will be given a single number, it should return a list of strings of numbers. Each string in the list will only contain a single number repeated an arbitrary amount of times. The number each string will contain will be equal to the current string's index+1. The number in the string should be repeated the same number of times as the string's index+1. Each number in the string should be separated by a space. This list should stop when its size equals the max number specified. Signature: public static ArrayList<String> returnGrowingNumList(int max) Example: INPUT: 3OUTPUT: [1, 2 2, 3 3 3] INPUT: 6OUTPUT: [1, 2 2, 3 3 3, 4 4 4 4, 5 5 5 5 5, 6 6 6 6 6 6]
CS) Please write this code in the C language. Also, be clear you need only implement the sort algorithm and save the file with the name "srtheap.c". Please do not copy and paste from other similar questions.
//main.cpp #include<iostream>#include<cmath>#include<string>#include<cstring>#include<algorithm>#include<list>using namespace std; #include "Dog.h" void popDogs(list<Dog>&); /** Change NOTHING above this line **/ //TODO, overload << operator//here's a startostream& operator<<(ostream& os, Dog& d){ //Insert code here so that when a Dog is output, it is done as: //dogName weighs weight pounds. //Like: //Spot weighs 28 pounds. //Don't forget the period at the end. Do NOT include an endl at the end of the line. os<< d.dogName<< " weighs " << d.weight << " pounds."; return os; } int main(){ //TODO, instantiate list of Dog variable called kennel. list<Dog> kennel; //TODO, call the popDogs function passing the kennel variable declared above popDogs(kennel); //This code will sort the list of Dog using the less-than operator kennel.sort();…
C++ language. Using the coding prepared below, add and create the Undo last pop, Display undo list and Redo Functions void functions but keep them as they are. NOTE: use the coding given, i don't want a new coding The code: #include<iostream>#include<iomanip>#include<ctype.h> using namespace std; struct nodeWords{ char words[100]; struct nodeWords *next;}; nodeWords* top; //these pointers are used to hold the linked list.nodeWords* current; //use for traversalnodeWords* newNode; //use to create new node for new recordnodeWords* pop; void Push(){ char answer; do { newNode = new nodeWords; cout << "\nWrite what's in your mind.." << endl; cout << "Your words > "; cin >> ws; cin.getline(newNode->words, 100); newNode->next = top; top = newNode; cout << "\nWant to write more? Press Y for yes and N for no: "; cin >> answer; }…