Check the array is Sorted or Not ? If Sorted so in which order Ascending or descending? I/P:- 1,1,1,1,2,3,4,4,5,6,7 O/P:- Ascending order Sorted I/P:- 9,9,8,7,6,5,5,5,5,4,3 O/P :- Descending order Sorted I/P:- 1,1,2,3,3,4,3,3,4,5,6,7 O/P :- Not Sorted I/P :- 9,9,9,8,7,6,5,5,6,4,3,2,1 O/P:- Not Sorted Time Complexity :- O(n) Note :- if you sort the input then match, sort function time Complexity is O(nlogn) Expected time Complexity is O(n)

So no one will help me by answering my question😔

See test cases

So I've need doing some research on data compression and I came across something called the Huffman tree and how it reduces the number of bits in a set off data... But I have two questions... Does the Huffman tree itself take up storage space since it's included on the file once it's compressed and if it does how much space would it take. Thank you in advance.

it works

E.g 1,1,1,2,3,4 For (int I =0;I<n;I++) { If ( arr[i] < arr[I+1]) .......... It won't work

E.g 1,1,1,2,3,4 For (int I =0;I<n;I++) { If ( arr[i] < arr[I+1]) .......... It won't work

Check the array is Sorted or Not ? If Sorted so in which order Ascending or descending? I/P:- 1,1,1,1,2,3,4,4,5,6,7 O/P:- Ascending order Sorted I/P:- 9,9,8,7,6,5,5,5,5,4,3 O/P :- Descending order Sorted I/P:- 1,1,2,3,3,4,3,3,4,5,6,7 O/P :- Not Sorted I/P :- 9,9,9,8,7,6,5,5,6,4,3,2,1 O/P:- Not Sorted Time Complexity :- O(n) Note :- if you sort the input then match, sort function time Complexity is O(nlogn) Expected time Complexity is O(n)

Please look at whole code User input array can be anything It can be ascending It can be descending Or not Sorted. We have to code that It's ascending, descending or not Sorted

Please look at whole code User input array can be anything It can be ascending It can be descending Or not Sorted. We have to code that It's ascending, descending or not Sorted

so we are traversing : check 1: a[1]>a[0] then.... a[i+1]>a[i] till n, if failed in between break and false. and if i==n-1; print true. similary for other case. time complexity o(n)+1 maximum

then >=

is C deprecated?

ok so is better if i learn c++

ok so is better if i learn c++

Check the array is Sorted or Not ? If Sorted so in which order Ascending or descending? I/P:- 1,1,1,1,2,3,4,4,5,6,7 O/P:- Ascending order Sorted I/P:- 9,9,8,7,6,5,5,5,5,4,3 O/P :- Descending order Sorted I/P:- 1,1,2,3,3,4,3,3,4,5,6,7 O/P :- Not Sorted I/P :- 9,9,9,8,7,6,5,5,6,4,3,2,1 O/P:- Not Sorted Time Complexity :- O(n) Note :- if you sort the input then match, sort function time Complexity is O(nlogn) Expected time Complexity is O(n)

Nice bio, nigga

That's a hot bio

make a binary tree using that array sequence, if it is ascending/descending it will always be a pathological tree

Uh oh, we have a trap lover here

Making binary tree is O(n * log n)

Based faggot

and creating a pathological tree will make it O(n), so still linear

I still don't see how it is better than just naive comparision.

Example: 0 ?

and creating a pathological tree will make it O(n), so still linear

how so? Insertion into a BST is log N and you have to do it N Times

c is entering its maintenance period like cobol

its like a 55 years old guy who is about to retire but still work some out

https://www.tiobe.com/tiobe-index/

you know tiobe is the most bullshit joke right? they rank languages by keyword searches. this means short and high frequency word even if it is not related to the language itself will ve been counted

most of the fundamental software around us is written on C

nowdays is the best choice for it

C is created initially for system programming

I think nothing will replace C. unless kiddos with python and js will get supercomputers and write OS on them lol

I thought C was created so code written once would work everywhere?

I thought C was created so code written once would work everywhere?

They are not smart enough to write an OS.

rust: haha safe system programming go reeeeeeee

true too

They are not smart enough to write an OS.

you know.. import OS;

c has nothing to do with portability