can you do this code faster? it need a better searching algorithm. you can oly use #include

#include

$-----------$

#include "trendtracker.h$"$

Trendtracker::Trendtracker$()\{$

E$.$clear$()$;

$\}$

void Trendtracker::insert$($std::string ht$)\{$

for $($Entry& entry : E$)\{$

if $($entry$.$hashtag $==$ ht$)\{$

return;

$\}$

$\}$

Entry newEntry;

newEntry.hashtag $=$ ht;

newEntry.pop $=0$;

E$.$push$\_$back$($newEntry$)$;

$\}$

int Trendtracker::size$()\{$

return E$.$size$()$;

$\}$

void Trendtracker::tweeted$($std::string ht$)\{$

for $($Entry& entry : E$)\{$

if $($entry$.$hashtag $==$ ht$)\{$

entry.pop$++$;

return;

$\}$

$\}$

$\}$

int Trendtracker::popularity$($std::string ht$)\{$

for $($const Entry& entry : E$)\{$

if $($entry$.$hashtag $==$ ht$)\{$

return entry.pop;

$\}$

$\}$

return $-1$;

$\}$

std::string Trendtracker::top$\_$trend$()\{$

if $($E$.$empty$())\{$

return $""$;

$\}$

int maxPop $=$ E$[0].$pop;

std::string topHashtag $=$ E$[0].$hashtag;

for $($const Entry& entry : E$)\{$

if $($entry$.$pop $>$ maxPop$)\{$

maxPop $=$ entry.pop;

topHashtag $=$ entry.hashtag;

$\}$

$\}$

return topHashtag;

$\}$

void Trendtracker::top$\_$three$\_$trends$($std::vector& T$)\{$

$//$ Sort the entries based on popularity

for $($size$\_$t i $=0$; i $<$ E$.$size$()$; $++$i$)\{$

for $($size$\_$t j $=$ i $+1$; j $<$ E$.$size$()$; $++$j$)\{$

if $($E$[$j$].$pop $>$ E$[$i$].$pop$)\{$

std::swap$($E$[$i$],$ E$[$j$])$;

$\}$

$\}$

$\}$

T$.$clear$()$;

for $($const Entry& entry : E$)\{$

T$.$push$\_$back$($entry$.$hashtag$)$;

if $($T$.$size$()>=3)\{$

break;

$\}$

$\}$

$\}$

void Trendtracker::remove$($std::string ht$)\{$

for $($auto it $=$ E$.$begin$()$; it $!=$ E$.$end$()$; $++$it$)\{$

if $($it$->$hashtag $==$ ht$)\{$

E$.$erase$($it$)$;

break;

$\}$

$\}$

$\}$

void Trendtracker::top$\_$k$\_$trends$($std::vector& T$,$ int k$)\{$

$//$ Sort the entries based on popularity

for $($size$\_$t i $=0$; i $<$ E$.$size$()$; $++$i$)\{$

for $($size$\_$t j $=$ i $+1$; j $<$ E$.$size$()$; $++$j$)\{$

if $($E$[$j$].$pop $>$ E$[$i$].$pop$)\{$

std::swap$($E$[$i$],$ E$[$j$])$;

$\}$

$\}$

$\}$

T$.$clear$()$;

for $($const Entry& entry : E$)\{$

T$.$push$\_$back$($entry$.$hashtag$)$;

if $($T$.$size$()>=$ k$)\{$

break;

$\}$

$\}$

$\}$