PlaylistNode.cpp (lab 9)
0 likes • Nov 18, 2022 • 0 views
C++
Loading...
More C++ Posts
//From https://create.arduino.cc/projecthub/abhilashpatel121/easyfft-fast-fourier-transform-fft-for-arduino-9d2677#include <cmath>#include <iostream>const unsigned char sine_data[] = { //Quarter a sine wave0,4, 9, 13, 18, 22, 27, 31, 35, 40, 44,49, 53, 57, 62, 66, 70, 75, 79, 83, 87,91, 96, 100, 104, 108, 112, 116, 120, 124, 127,131, 135, 139, 143, 146, 150, 153, 157, 160, 164,167, 171, 174, 177, 180, 183, 186, 189, 192, 195, //Paste this at top of program198, 201, 204, 206, 209, 211, 214, 216, 219, 221,223, 225, 227, 229, 231, 233, 235, 236, 238, 240,241, 243, 244, 245, 246, 247, 248, 249, 250, 251,252, 253, 253, 254, 254, 254, 255, 255, 255, 255};float sine(int i){ //Inefficient sineint j=i;float out;while(j < 0) j = j + 360;while(j > 360) j = j - 360;if(j > -1 && j < 91) out = sine_data[j];else if(j > 90 && j < 181) out = sine_data[180 - j];else if(j > 180 && j < 271) out = -sine_data[j - 180];else if(j > 270 && j < 361) out = -sine_data[360 - j];return (out / 255);}float cosine(int i){ //Inefficient cosineint j = i;float out;while(j < 0) j = j + 360;while(j > 360) j = j - 360;if(j > -1 && j < 91) out = sine_data[90 - j];else if(j > 90 && j < 181) out = -sine_data[j - 90];else if(j > 180 && j < 271) out = -sine_data[270 - j];else if(j > 270 && j < 361) out = sine_data[j - 270];return (out / 255);}//Example data://-----------------------------FFT Function----------------------------------------------//float* FFT(int in[],unsigned int N,float Frequency){ //Result is highest frequencies in order of loudness. Needs to be deleted./*Code to perform FFT on arduino,setup:paste sine_data [91] at top of program [global variable], paste FFT function at end of programTerm:1. in[] : Data array,2. N : Number of sample (recommended sample size 2,4,8,16,32,64,128...)3. Frequency: sampling frequency required as input (Hz)If sample size is not in power of 2 it will be clipped to lower side of number.i.e, for 150 number of samples, code will consider first 128 sample, remaining sample will be omitted.For Arduino nano, FFT of more than 128 sample not possible due to mamory limitation (64 recomended)For higher Number of sample may arise Mamory related issue,Code by ABHILASHContact: [email protected]Documentation:https://www.instructables.com/member/abhilash_patel/instructables/2/3/2021: change data type of N from float to int for >=256 samples*/unsigned int sampleRates[13]={1,2,4,8,16,32,64,128,256,512,1024,2048};int a = N;int o;for(int i=0;i<12;i++){ //Snapping N to a sample rate in sampleRatesif(sampleRates[i]<=a){o = i;}}int in_ps[sampleRates[o]] = {}; //input for sequencingfloat out_r[sampleRates[o]] = {}; //real part of transformfloat out_im[sampleRates[o]] = {}; //imaginory part of transformint x = 0;int c1;int f;for(int b=0;b<o;b++){ // bit reversalc1 = sampleRates[b];f = sampleRates[o] / (c1 + c1);for(int j = 0;j < c1;j++){x = x + 1;in_ps[x]=in_ps[j]+f;}}for(int i=0;i<sampleRates[o];i++){ // update input array as per bit reverse orderif(in_ps[i]<a){out_r[i]=in[in_ps[i]];}if(in_ps[i]>a){out_r[i]=in[in_ps[i]-a];}}int i10,i11,n1;float e,c,s,tr,ti;for(int i=0;i<o;i++){ //ffti10 = sampleRates[i]; // overall values of sine/cosine :i11 = sampleRates[o] / sampleRates[i+1]; // loop with similar sine cosine:e = 360 / sampleRates[i+1];e = 0 - e;n1 = 0;for(int j=0;j<i10;j++){c=cosine(e*j);s=sine(e*j);n1=j;for(int k=0;k<i11;k++){tr = c*out_r[i10 + n1]-s*out_im[i10 + n1];ti = s*out_r[i10 + n1]+c*out_im[i10 + n1];out_r[n1 + i10] = out_r[n1]-tr;out_r[n1] = out_r[n1]+tr;out_im[n1 + i10] = out_im[n1]-ti;out_im[n1] = out_im[n1]+ti;n1 = n1+i10+i10;}}}/*for(int i=0;i<sampleRates[o];i++){std::cout << (out_r[i]);std::cout << ("\t"); // un comment to print RAW o/pstd::cout << (out_im[i]); std::cout << ("i");std::cout << std::endl;}*///---> here onward out_r contains amplitude and our_in conntains frequency (Hz)for(int i=0;i<sampleRates[o-1];i++){ // getting amplitude from compex numberout_r[i] = sqrt(out_r[i]*out_r[i]+out_im[i]*out_im[i]); // to increase the speed delete sqrtout_im[i] = i * Frequency / N;std::cout << (out_im[i]); std::cout << ("Hz");std::cout << ("\t"); // un comment to print freuency binstd::cout << (out_r[i]);std::cout << std::endl;}x = 0; // peak detectionfor(int i=1;i<sampleRates[o-1]-1;i++){if(out_r[i]>out_r[i-1] && out_r[i]>out_r[i+1]){in_ps[x] = i; //in_ps array used for storage of peak numberx = x + 1;}}s = 0;c = 0;for(int i=0;i<x;i++){ // re arraange as per magnitudefor(int j=c;j<x;j++){if(out_r[in_ps[i]]<out_r[in_ps[j]]){s=in_ps[i];in_ps[i]=in_ps[j];in_ps[j]=s;}}c=c+1;}float* f_peaks = new float[sampleRates[o]];for(int i=0;i<5;i++){ // updating f_peak array (global variable)with descending orderf_peaks[i]=out_im[in_ps[i]];}return f_peaks;}//------------------------------------------------------------------------------------////main.cppint data[64]={14, 30, 35, 34, 34, 40, 46, 45, 30, 4, -26, -48, -55, -49, -37,-28, -24, -22, -13, 6, 32, 55, 65, 57, 38, 17, 1, -6, -11, -19, -34,-51, -61, -56, -35, -7, 18, 32, 35, 34, 35, 41, 46, 43, 26, -2, -31, -50,-55, -47, -35, -27, -24, -21, -10, 11, 37, 58, 64, 55, 34, 13, -1, -7};int main(){const unsigned int SAMPLE_RATE = 48*1000; //48khzauto result = FFT(data,64,SAMPLE_RATE);std::cout << result[0] << " " << result[1] << " " << result[2] << " " << result[3] << std::endl;delete[] result;return 0;}
/*Good morning! Here's your coding interview problem for today.This problem was asked by Stripe.Given an array of integers, find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can contain duplicates and negative numbers as well.For example, the input [3, 4, -1, 1] should give 2. The input [1, 2, 0] should give 3.You can modify the input array in-place.*/#include <iostream>using namespace std;int calcMissing(int* input, int size){int sum = 0;int n = 1; //add one to account for missing valuefor(int i = 0; i < size; i++){if(input[i] > 0){sum += input[i];n++;}}//If no numbers higher than 0, answer is 1if(sum == 0)return 1;return (n*(n+1)/2) - sum; //Formula is expectedSum - actualSum/* expectedSum = n*(n+1)/2, the formula for sum(1, n) */}int main(){cout << calcMissing(new int[4]{3, 4, -1, 1}, 4) << endl;cout << calcMissing(new int[3]{1, 2, 0}, 3) << endl;//No positive numberscout << calcMissing(new int[1]{0}, 1) << endl;}
#include "stdio.h"#include <stdlib.h>int main (int argCount, char** args) {int a = atoi(args[1]);int b = atoi(args[2]);unsigned int sum = 0;unsigned int p = 1;for (unsigned int i = 1; i < b; i++) {p = p * i;}// (b!, (1 + b)!, (2 + b)!, ..., (n + b)!)for (unsigned int i = 0; i < a; i++) {p = p * (i + b);sum = sum + p;}printf("y: %u\n", sum);return 0;}
#include <iostream>using namespace std;int main(){cout << "Hello, World!" << endl;return 0;}
#include <iostream>using namespace std;int main() {cout << "Hello World!\n";// Prints out "Hello World"return 0;}
#include <iostream>#include "PlaylistNode.h"using namespace std;void PrintMenu(string title);int main() {string plTitle;cout << "Enter playlist's title:" << endl;getline(cin, plTitle);PrintMenu(plTitle);return 0;}void PrintMenu(string title) {Playlist list;string id;string sname;string aname;int length;int oldPos;int newPos;char choice;while(true) {cout << endl << title << " PLAYLIST MENU" << endl;cout << "a - Add song" << endl;cout << "d - Remove song" << endl;cout << "c - Change position of song" << endl;cout << "s - Output songs by specific artist" << endl;cout << "t - Output total time of playlist (in seconds)" << endl;cout << "o - Output full playlist" << endl;cout << "q - Quit" << endl << endl;cout << "Choose an option:" << endl;cin >> choice;cin.ignore();if (choice == 'q') {exit(1);}else if (choice == 'a') {cout << "\nADD SONG" << endl;cout << "Enter song's unique ID: ";cin >> id;cin.ignore();cout << "Enter song's name: ";getline(cin,sname);cout << "Enter artist's name: ";getline(cin,aname);cout << "Enter song's length (in seconds): ";cin >> length;list.AddSong(id, sname, aname, length);}else if (choice == 'd') {cout << "\nREMOVE SONG" << endl;cout << "Enter song's unique ID: ";cin >> id;list.RemoveSong(id);}else if (choice == 'c') {cout << "\nCHANGE POSITION OF SONG" << endl;cout << "Enter song's current position: ";cin >> oldPos;cout << "Enter new position for song: ";cin >> newPos;list.ChangePosition(oldPos, newPos);}else if (choice == 's') {cout << "\nOUTPUT SONGS BY SPECIFIC ARTIST" << endl;cout << "Enter artist's name: ";getline(cin, aname);list.SongsByArtist(aname);}else if (choice == 't') {cout << "\nOUTPUT TOTAL TIME OF PLAYLIST (IN SECONDS)" << endl;cout << "Total time: " << list.TotalTime() << " seconds" << endl;}else if (choice == 'o') {cout << endl << title << " - OUTPUT FULL PLAYLIST" << endl;list.PrintList();}else {cout << "Invalid menu choice! Please try again." << endl;}}}